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@gmane.org> 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