[ITK] Efficient Shortest Paths algorithm

[Lowekamp, Bradley (NIH/NLM/LHC) [C]]

Hello,

The CollidingFrontsImageFilter[1] may have been used for a similar purposes for vessel segmentation. I believe Luca Antiga has been involved with this algorithms and his VMTK toolkit, is you need additional starting place to search for more information on how to use the method.

HTH,
Brad



[1] http://public.kitware.com/Insight/Doxygen/html/classitk_1_1CollidingFrontsImageFilter.html

> On Oct 11, 2016, at 12:51 PM, 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