Hello,

I would like to implement a Mutliple destination Shortest Path Dijkstra, as
in  pgrouting <http://docs.pgrouting.org/dev/src/kdijkstra/doc/index.html>
(see also this oldish  networkx ticket
<https://networkx.lanl.gov/trac/changeset/c1dbf20b5cbf2d15e1c08846b736572c328db971/networkx>
).

As I need it to be fast, I plan to do it in the CPP side of graph-tool.
However, my CPP skills are quite limited. Would you have some references to
guide me in the right direction ?

Best,
François



--
View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Mutliple-destination-Shortest-Path-Dijkstra-tp4026059.html
Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.
_______________________________________________
graph-tool mailing list
graph-tool@skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool