Minimum Spanning Tree Algorithms

Algorithms that connect every vertex of a weighted graph at the least total edge weight, such as Kruskal's algorithm, Prim's algorithm, Boruvka's algorithm and the reverse-delete algorithm. An algorithm belongs here when its cited article says it finds a minimum spanning tree or forest. It excludes shortest path algorithms, which answer a different question. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.