search

seung-lab / dijkstra3d

Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
GNU General Public License v3.0
71 stars 13 forks source link

feat: bidirectional dijkstra #5

Closed william-silversmith closed 4 years ago

william-silversmith commented 5 years ago

Resolves #2

Adds bidirectional dijkstra as a flag on the dijkstra method.

path = dijkstra3d.dijkstra(x, source=(0,0,0), target=(511, 511, 511), bidirectional=True)