Given a weighted, connected graph, the MST is the connected subgraph containing all the nodes, that minimizes the sum of its edges.
The animation uses the euclidian distance as weights, and Prims algorithm to compute the MST