Yes, but it set bidirectionalS in adjacency_list. Doesn't it say that we could walk in both ways?

2012/9/24 Jeremiah Willcock <jewillco@osl.iu.edu>
On Mon, 24 Sep 2012, tolik levchik wrote:

The following code http://ideone.com/MbvUI outputs 'false', why?

Your graph does not actually have a cycle.  Here is a drawing of it:

A ---> B
|      ^
|     /
|    /
|   /
|  /
| /
v/
C

In particular, notice that there is a topological order for the graph: A, C, B; all edges go forward in that order.

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