The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.

• 对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。