From: Doug Gregor (dgregor_at_[hidden])
Date: 2004-11-24 12:08:34
On Aug 19, 2004, at 12:33 AM, Synge Todo wrote:
> I'm posting a non-recursive version of undirected_dfs, which should
> have advantages in space and time over the current implmentation
> based on recursion, especially for huge graphs. It's a direct
> counterpart of the non-recursive version of depth_first_search for
> I have confirmed that libs/graph/example/undirected_dfs.cpp as well as
> my own programs using undirected_dfs reproduce the identical outputs as
> those with the original recursive version.
Looks good! I've (finally) checked this into CVS.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk