[Boost-users] undirected graph cycle

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. Thanks, Matt ------------------------------------------------- This mail sent through IMP: http://horde.org/imp/