What would you recommend ? 

I would implement a new class called djk_max_multiple_targets_visitor that would be used in get_dists only when there are more than one target. Does it sounds good? 

F

2015-04-13 20:32 GMT+02:00 Tiago Peixoto [via Main discussion list for the graph-tool project] <[hidden email]>:
On 13.04.2015 20:23, François Kawala wrote:
> I guess that I should update accordingly the *get_dists *function.
>
> Should I submit a pull request once that done ?

Sure, but be careful not to compromise the performance in the case where
there is only a single target.

Best,
Tiago

--
Tiago de Paula Peixoto <[hidden email]>


_______________________________________________
graph-tool mailing list
[hidden email]
http://lists.skewed.de/mailman/listinfo/graph-tool

signature.asc (836 bytes) Download Attachment
--
Tiago de Paula Peixoto <[hidden email]>


If you reply to this email, your message will be added to the discussion below:
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Mutliple-destination-Shortest-Path-Dijkstra-tp4026059p4026068.html
To start a new topic under Main discussion list for the graph-tool project, email [hidden email]
To unsubscribe from Main discussion list for the graph-tool project, click here.
NAML



--
François Kawala

View this message in context: Re: Mutliple destination Shortest Path Dijkstra
Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.