This is a visual representation of two main MST algorithms. The one on the left is Prim's algorithm, and the one on the right is Kruskal's algorithm. They are both finding the MST of a complete graph with the Euclidean distance between each vertex as the edge weight.