Shortest path with Python

[AndersDeleuran]

You can implement networkx. Here’s a recent example:

Shortest path - taking obstacles and the terrain into account

FWIW, it’d be pretty trivial to add slope angle as the edge weight to this MeshPaths GHPython component I once wrote (i.e. add another weightMode to the two functions that generate the graph), which implements networkx for the graph computation. You can download the 1.5 version here and unzip it to: C:\Users\USERNAME\AppData\Roaming\McNeel\Rhinoceros\7.0\scripts Edit: Here’s a quick implementation of what I was suggesting above. I also added a Smoothen input, which iteratively averages the pa…

Or implement e.g. Dijkstra’s shortest path natively. Example here:

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

Hi @STUDENT_F, Here’s a GHPython implementation of Dijkstar’s Shortest Path algorithm I wrote awhile back. [49] 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)