|
|
Boost Users : |
Subject: Re: [Boost-users] boost::graph find the cycle
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-09-24 03:47:02
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 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