Re: [Boost-users] boost::graph find the cycle

Subject: Re: [Boost-users] boost::graph find the cycle
From: tolik levchik (endight_at_[hidden])
Date: 2012-09-24 03:47:33

Yes it is, sorry for dumb questions.

2012/9/24 tolik levchik <endight_at_[hidden]>

> Ok, but then graph (A, B) also have cycles. Is that right too?
>
> 2012/9/24 Jeremiah Willcock <jewillco_at_[hidden]>
>
>> 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
>> _______________________________________________
>> Boost-users mailing list
>> Boost-users_at_[hidden]
>> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>>
>
>