[Boost-users] How can I find all the shortest path in a graph?

From: Giulio Veronesi (giulio_veronesi_at_[hidden])
Date: 2005-09-16 01:41:42

Hi all,

Please excuse me if I post my question again, but I've spent all the 
night and the day before looking for a solution of the following problem:

How to find *all* the possible shortest paths from a source vertex to a 
target vertex in a directed graph?

I tried using depth_first_search and acting on visitors without any success.

Please, could you help me?

Thanks a lot in advance,
Giulio