Boost logo

Boost Users :

From: Alex Helder (dev_null_1_at_[hidden])
Date: 2005-05-14 01:45:05


If I have two graphs,

G = ( E, V)
G' = ( E', V' )

what would be the most efficient way, using BGL, to determine whether G'
is a subgraph of G?. I'm not interested in 'isomorphic' subgraphs.

Of course, if G' is a subset of G, then E' is a subset
of E and V' is a subset of V.

I guess I could iterate over all the edge and vertex descriptors for
both graphs ...

but I was wondering if there was another way. I'm not experienced with
graph theory (if that isn't obvious by now!)


Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at