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

From: James Jackson (james.jackson_at_[hidden])
Date: 2008-01-31 09:08:57

OK, thanks. I have implemented (although not with the BGL for  
simplicity) a modified Dijkstra's algorithm which returns all shortest  
paths (a rather simpler problem that that of the K shortest paths, as  
suggested in the link). I will try and find time to port this as a BLG  
algorithm and make it available.

Regards,
James.

On 31 Jan 2008, at 12:36, Aaron Windsor wrote:

> 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
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users