Re: [Boost-users] [Graph] How to do multi source shortest path

Subject: Re: [Boost-users] [Graph] How to do multi source shortest path
From: Leo Hidd (leohidd_at_[hidden])
Date: 2012-03-12 22:07:20

Le 09/03/2012 19:04, Jeremiah Willcock a écrit :
> On Fri, 9 Mar 2012, Leo Hidd wrote:
>
>>
>>>> An additional question, is there a way to modify the target or the 
>>>> source vertex of an edge? It would be useful to me because I run 
>>>> several iterations of MSSP with a different set of sources for each 
>>>> iteration (but the number of the sources is the same). Modifying 
>>>> the source/targe of an edge would avoid delete/re-add the 
>>>> zero-weight edges.
>>>
>>> No, there isn't.  A direct implementation of MSSP will solve your 
>>> problem, though, and I am working on one.  It will probably be 
>>> committed to the Boost trunk next week.
>>>
>> wow, nice, thank you sir! Do you plan to also implement the 
>> distributed/parallel version of it, like for the 
>> delta_stepping_shortest_paths()?
>
> I was planning on just doing the sequential version.
>
> -- Jeremiah Willcock

it would be so nice to have the distributed MSSP, but I ignore how time 
consuming it would be to implement it in boost. A priori it should be as 
difficult (or easy) as for single source. Please let me know if you 
consider to implement distributed MSSP.