|
Boost Users : |
Subject: Re: [Boost-users] boost::graph find the cycle
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-09-24 03:20:53
On Mon, 24 Sep 2012, tolik levchik wrote:
> The following code http://ideone.com/MbvUI%a0outputs '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 list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net