Re: [Boost-users] BGL: return all shortest paths between two vertices

On Jan 30, 2008 11:25 AM, James Jackson wrote:

I have a subquestion... Is there an algorithm that will return all shortest paths between two vertices? (I.e. like Djikstra's algorithm but returning all, not just one, shortest path should such a condition exist).

Hi James, See this message from the boost users list a few years ago: http://lists.boost.org/boost-users/2005/09/13987.php Regards, Aaron