Python Shortest Walk 3D: Interpolate grid of points with start & end point to get shortest curve thorough points of grid

[diff-arch]

Hi @STUDENT_F,

Here’s a GHPython implementation of Dijkstar’s Shortest Path algorithm I wrote awhile back.

It should work with multiple start and end points in 2D as well as in 3D space. The graph connections are evaluated beforehand by a separate component. The connections are evaluated by proximity. A higher radius means more possible connections.

Feel free to check it out below.
dijkstra_v2.gh (36.0 KB)