By Kruskal (Kruskal) algorithm ideas, the preparation of a minimum spanning tree of a complete search procedure.

• (译)：由克鲁斯卡尔（秩）算法的思想，编制一个最小生成树一个完整的搜索程序。