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).<br>if any exception throwed, the graph is not a tree<br><br><div class="gmail_quote">
2010/3/30 Michał Nowotka <span dir="ltr">&lt;<a href="mailto:mmmnow@gmail.com">mmmnow@gmail.com</a>&gt;</span><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hello,<br>
Although some time ago I used boost graph in some of my projects I<br>
found this library too generic for me :) I still have some questions:<br>
<br>
1. How to check if my graph is a tree?<br>
2. How to generate random graph? (using generate_random_graph)  - I<br>
can&#39;t find any examples of random graph generation so it should be<br>
very very easy and I need the simplest possible example.<br>
3. How to use layout functions like random_graph_layout? - as in the<br>
question above I can&#39;t find any examples.<br>
<br>
4. Can I perform all this actions on graph of type<br>
boost::adjacency_matrix&lt;boost::directedS&gt; ?<br>
<font color="#888888"><br>
<br>
--<br>
Regards<br>
<br>
Michał Nowotka<br>
_______________________________________________<br>
Boost-users mailing list<br>
<a href="mailto:Boost-users@lists.boost.org">Boost-users@lists.boost.org</a><br>
<a href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost-users</a></font></blockquote></div><br>