Yes, it sounds like you need to modify the type definition for your graph. (at least, that will give you the best efficiency. You could also use a hash table of some sort provided you don't have parallel edges in your graph) BTW, in the BGL, a const graph parameter means that the algorithm will not add or remove vertices or edges, but it does not necessarily mean that the algorithm will not modify properties of the edges or vertices... that is determined by the kind of property map that the algorithm requires, in this case the ComponentMap must be a Writable Property Map. HTH, Jeremy On Aug 25, 2005, at 8:23 AM, Greg Landrum wrote:
Janusz Piwowarski wrote:
Greg Landrum wrote:
The example in exterior_properties.cpp seems to require that the graph have a boost::edge_index_t property map associated with its edges. If this is true, it means that in order to call biconnected_components on a graph that truly must be const, I need to modify the definition of my graph. Is this truly intended?
I guess you need only number of biconnected components, don't you? If so, use dummy_property_map().
erm, no. I need the assignments of the graph edges to the components.
-greg _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users