I would be nice to have in the BGL examples list how to cut and traverse over the disconnected subgraphs/components.

On Wed, Nov 25, 2009 at 2:07 PM, Gábor Szuromi <kukkerman@gmail.com> wrote:

On second thought Prim's algorithm computes only the spanning tree of
the component the starting vertex belongs to. So instead you can use
the edge list returned by Kruskal's algorithm to mark tree edges and
then use filtered_graph to hide non-marked edges and transform the
original graph into a forest without creating a new graph. The
predecessor map can be used to identify the root node of trees.

Gabe
_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users