Hi Hugues, On Jan 29, 2004, at 8:36 AM, Hugues Joly wrote:
Hi, I'm wondering if defining a graph as a pointer-linked vertex list is compatible with the subgraph paradigm.
Presumably, an adjacency list having its vertex descriptor defined as a pointer to a vertex object would fulfil our needs. But how this technique would behave when we deal with a subgraph having local vertex descriptors?
Let's see... here's the requirements on the Graph template parameter of subgraph: A graph type modeling VertexMutableGraph and EdgeMutableGraph. Also the graph must have internal vertex_index and edge_index properties. The vertex indices must be maintained automatically by the graph, whereas the edge indices will be assigned by the subgraph class implementation. Ok, so the vertex indices are not automatically maintained in adjacency_list when VertexList=listS, so that won't work. Sorry. (I'm sure it would be possible to change subgraph to lift this restriction, but that of course would take time). -Jeremy ------------------------------------------------------------------------ ----------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 856-1820 ------------------------------------------------------------------------ -----------------