Re: [boost] [bgl] Bug in depth_first_search (and therefore topological_sort...)

From: Doug Gregor (dgregor_at_[hidden])
Date: 2006-07-25 11:39:46

On Jul 25, 2006, at 10:42 AM, David Abrahams wrote:
> No.  The classic DFS algorithm works on disconnected graphs by
> repeatedly selecting a vertex and doing DFS from there.  It's weird
> that BFS and DFS are different in this regard, but there's a reason
> for it, IIRC, which now escapes me.

If you happen to remember the reason, I'd like to know, because I've  
been hoping to eliminate the difference for the far-off, much- 
anticipated "BGLv2".

        Doug