On Jun 24, 2010, at 10:12 AM, Jeremiah Willcock wrote:
Note that G0 is of type subgraph<...>, not adjacency_list<...> like you were using. Could that be the issue?
Yes, that's definitely something I was doing wrong. After rereading
the docs, I see now that subgraphs must be of a special subgraph class
type, but I don't understand why. Conceptually speaking, I see no
reason for this class to exist. For example, when implementing a
generic tree structure, there's no need to have separate "Node" and
"Subnode" classes; all nodes can be of type "Node". The top-level node
is distinguished simply by the fact that it has no parents. For the
same reason, the top-level graph in a hierarchy of graphs can have the
same type as any of its children (and vice versa). The way Boost
implements this concept seems overly complicated.
Design issues aside, I'm now trying to modify my graph code to use
subgraphs. To start off, I thought I would try changing my
adjacency_list to subgraph