Subject: Re: [Boost-users] boost::graph find the cycle
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-09-24 03:34:39
On Mon, 24 Sep 2012, tolik levchik wrote:
> Yes, but it set bidirectionalS in adjacency_list. Doesn't it say that we could walk in both ways?
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't have directions.
-- Jeremiah Willcock