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

From: Aaron Windsor (aaron.windsor_at_[hidden])
Date: 2008-01-31 07:36:38

On Jan 30, 2008 11:25 AM, James Jackson <james.jackson_at_[hidden]> 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