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:52:03

Hm, if i understood you correctly then the following code should outputs
false http://ideone.com/4NiqP, isn't it?

2012/9/24 Jeremiah Willcock <jewillco_at_[hidden]>

> On Mon, 24 Sep 2012, tolik levchik wrote:
>
>  Ok, but then graph (A, B) also have cycles. Is that right too?
>>
>
> Not if there is only one edge between A and B -- the same edge won't be
> considered twice in a cycle in an undirected graph.
>
> -- Jeremiah Willcock
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>