Boost logo

Boost Users :

From: magh_at_[hidden]
Date: 2003-12-27 13:53:44

Is there any easy way to use DFS visitors to return a cycle in an undirected
graph? The examples show how to detect if a cycle exists. How do you actually
extract it?

For my instance, I am dealing with an undirected graph that is a 1-tree, i.e.,
I know there is exactly one cycle.


This mail sent through IMP:

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at