Minimum Spanning Tree (Kruskal's algorithm)

Kruskal's algorithm finds a minimum-cost spanning tree on a fully-connected point graph. With "Shortest Paths" on, the closest point to the cursor seeds a Dijkstra-style nearest-paths tree. Click on the canvas to add a point; press space to reshuffle.