Re: [boost] [graph] non-recursive version of undirected_dfs

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 implementation based on recursion, especially for huge graphs. It's a direct counterpart of the non-recursive version of depth_first_search for digraphs.

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.

FYI, I haven't forgotten this patch, but was actually waiting for the release branch so I can go ahead and start dropping changes into the BGL. I'll review it then, and sorry for the delay. Doug