Use A-Star Algorithm (Shortest Path) in a 3D environment (networkx module)

BTW: This is the classic way to do a LOL D routing using Breps instead of points as nodes. Shown a (rather stupid) all to all “graph” (kinda) and a more reasonable one that is “like” a proximity graph using the GH component.

Moral: Abandon P, join the Dark Side ASAP (we have cookies for all).