
Boost Users : 
From: Alex Helder (dev_null_1_at_[hidden])
Date: 20050514 01:45:05
Hello:
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!)
Thanks
Alex
Boostusers list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net