Dijkstra 3D All Paths

[h-cohen]

Hi,

Trying to figure out how to use the parents function.
My goal is to obtain ALL possible shortest paths between a pair of nodes (or voxels).

Using the path_from_parents function is returning the same value as the regular dijkstra function.

Thank you for all your help,
Cheers

[william-silversmith]

Hi! Path from parents is used to find a single shortest path from any point on the grid. Currently, there is no function in dijkstra3d that exhaustively searches for all equal paths.

networkx does have a function for this: https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.all_shortest_paths.html#networkx.algorithms.shortest_paths.generic.all_shortest_paths

I don't know what your performance requirements are though.