[ITK] Efficient Shortest Paths algorithm

[Timothee Evain]

Dan, Brad,

Your suggestions have been very helpful, I've tried the MinimalPathExtraction and it seems to fulfill all my needs for now.
Many thanks!

Tim

----- Mail original -----
De: "Dan Mueller" <dan.muel at gmail.com>
À: "Timothee Evain" <tevain at telecom-paristech.fr>
Cc: community at itk.org
Envoyé: Mercredi 12 Octobre 2016 07:00:51
Objet: Re: [ITK] Efficient Shortest Paths algorithm

Hi Tim,

For a continuous minimal path algorithm see here:
https://itk.org/Doxygen/html/group__MinimalPathExtraction.html
https://github.com/InsightSoftwareConsortium/ITKMinimalPathExtraction

I believe there was also a discrete Dijkstra implementation published in
the Insight Journal.

Hope this helps, Dan

On 12 Oct 2016 3:21 am, "Timothee Evain" <tevain at telecom-paristech.fr>
wrote:

> Hello people,
>
> Does anyone know an efficient c++ implementation of shortest paths
> algorithms for large graphs (like the ones obtained by considering images
> as graph, which result in numerous vertices and edges)?
> I'm interested in the Floyd Warshall algorithm as well as the Dijkstra's
> one.
>
> Tim
> _______________________________________________
> Community mailing list
> Community at itk.org
> http://public.kitware.com/mailman/listinfo/community
>