[GHX: 0.8.0066] This is the continuation of my scripting experiment within Grasshopper. Like minimum spanning tree algorithm, this is also a famous problem of computational geometry. I’m now coding faster and understanding the namespace easier in Grasshopper. This time, challenge was to implement Dijkstra’s algorithm of shortest paths. Again, it’s a quite useful algorithm, I even plan to use it in my current project. Although there is a faster alternative, Shortest Walk, I’m happy with this result. Like minimum spanning tree, this script also possibly contains bugs and miscalculations. E.g. in […]