For the first question, I think you can use the breadth first search with a
BFSVistor which throws an exception in vis.non_tree_edge(e,g).
if any exception throwed, the graph is not a tree
2010/3/30 Michał Nowotka
Hello, Although some time ago I used boost graph in some of my projects I found this library too generic for me :) I still have some questions:
1. How to check if my graph is a tree? 2. How to generate random graph? (using generate_random_graph) - I can't find any examples of random graph generation so it should be very very easy and I need the simplest possible example. 3. How to use layout functions like random_graph_layout? - as in the question above I can't find any examples.
4. Can I perform all this actions on graph of type boost::adjacency_matrixboost::directedS ?
-- Regards
Michał Nowotka _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users