From: Jurko Gospodnetiæ (jurko_for_boost_at_[hidden])
Date: 2004-11-15 04:17:13
> I have a directed BGL graph. Given two vertices U and V, I want to know
> whether there is a path from U to V. I don't care what path it is; I just
> want to know whether one exists or not. It looks like I might be able to
> the BFS or DFS to do this, but that seems like attacking a mosquito with a
Hmmm... I do not think you can do better than BFS unless your particular
graph has some special knowledge in it that we are not aware of. Also...
with BFS you do get the shortest path available and I believe you can force
it to solve your 'more complicated' problem as well...
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk