feat: hillclimbing distance metric

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

Closed william-silversmith closed 2 years ago

william-silversmith commented 3 years ago

Experimenting with a hill climbing distance metric as requested in #26