Kruskal's Algorithm Animation - How does it progress?

The code for the Kruskal's algorithm and plotting the graphs can be found below:

As a continuation to the Prim's Algorithm animation, here I implement the Kruskal's Algorithm as it is applied on randomly distributed numbers. Starting from shortest distances point pairs are added into trees until all trees merge into a single tree with no cycles within. The resulting connection graph is the so called minimum spanning tree solution for the given point distribution.

Prim's Algorithm animation can be found here:

#kruskal #kruskalalgorithm #primalgorithm

0:00 First set of points
0:57 Another set of points
1:38 Clustering application