I forked the grap_tool github repo, and tried to update the grpah_distance.cc. 

The result is visible there. However, I'm not familiar with CPP, thus the result might be disappointing. 

Would it worth it that I try to go further on this ? 

Best,
—François.


2015-04-13 22:12 GMT+02:00 Tiago Peixoto [via Main discussion list for the graph-tool project] <[hidden email]>:
On 13.04.2015 23:06, François wrote:
> 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?

That sounds like the right approach.

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]>



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.