Robert C. Prim: Shortest connection networks and some generalizations, The Bell System Technical Journal, Vol. 36, No. 6, pp. 1389–1401 (1957). https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
http://www.prefield.com/algorithm/graph/prim.html
Kruskal 法
Joseph B. Kruskal: On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, Vol. 7, pp. 48–50 (1956). https://doi.org/10.1090/S0002-9939-1956-0078686-7