Shortest Path
The Shortest Path operator treats the points of the Path Geometry input as a network, connected along mesh edges or to neighbors within a distance, and finds for every point of the End Point Group the shortest route back to the nearest point of the Start Point Group. An optional Cost Attribute weights the traversal, and the operator outputs the paths as line strips together with the path geometry carrying distances and parents.
Until Converged solves the paths fully on each cook, while Single Pass grows them a few sweeps per cook through a feedback loop, which tracks a changing cost. With the Alternate Start/End Point Locations input connected, the groups are read from that input and mapped to the closest path points, Lock Alternate Start/End Point Locations freezes that mapping, and the visualization options color each path, the start and end points or the cost.
POP - Path GeometryPOP - Alternate Start/End Point LocationsPOP - Line Strips PathsPOP - Path Geometry
