Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
Bidirectional replacement paths and k-shortest paths search with dynamic programming
