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

Dijkstra Target Value #32

Closed william-silversmith closed 3 years ago

william-silversmith commented 3 years ago

Dijkstra usually works via a target position, but what if we want to find the path to a target value? For example, in an algorithm I'm thinking of, we'd want to find the path to the nearest zero weight "rail".

william-silversmith commented 3 years ago

This was added via #33