Kruskal’s Minimum Spanning Tree Algorithm

I’ve implemented networkx in GHPython for quite a broad range of problems. One example of this was computing minimum spanning trees for generating these catenary networks:

Note that there’s been some issues with compatibility with IronPython (i.e. the one used by Rhino) and networkx. My solution has been to just use version 1.5, but if I recall someone on the forum posted that they got a newer version recently (edit: it was @timothytai and @chanley over here :slight_smile: )

4 Likes