Ok, but then graph (A, B) also have cycles. Is that right too?<br><br><div class="gmail_quote">2012/9/24 Jeremiah Willcock <span dir="ltr">&lt;<a href="mailto:jewillco@osl.iu.edu" target="_blank">jewillco@osl.iu.edu</a>&gt;</span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">On Mon, 24 Sep 2012, tolik levchik wrote:<br>
<br>
</div><div class="im"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Yes, but it set bidirectionalS in adjacency_list. Doesn&#39;t it say that we could walk in both ways?<br>
</blockquote>
<br></div>
No -- it means that the edges are single-directional, but that you can find all edges into a particular vertex.  You might want undirectedS, which means that edges don&#39;t have directions.<span class="HOEnZb"><font color="#888888"><br>

<br>
-- Jeremiah Willcock</font></span><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><br></blockquote></div><br>