|
Boost Users : |
From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-11-14 23:26:41
Hi Matthew,
Luckily, another user already had the same problem you did.
There is now a special version of DFS for undirected graphs:
http://www.boost.org/libs/graph/doc/undirected_dfs.html
Cheers,
Jeremy
--On Thursday, November 14, 2002 10:16 AM -0500 Matthew Galati
<yg-boost-users_at_[hidden]> wrote:
> Can DFS be used to detect cycles in an undirected graph? Using the code
> in the example file_dependencies.cpp on an undirected graph - it detects
> cycles even though there is none. Do we have to do more than simply look
> for back edges for an undirected graph? or should I convert it to
> directed then use this function?
>
> Thanks,
> Matt
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