25 Jul
2006
25 Jul
'06
3:39 p.m.
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