prim算法 是一个比较常见的求最小生成树的算法,它用贪婪准则来编写算法的!-prim algorithm is a more common for the minimum spanning tree algorithm, which used to prepare guidelines for the greedy algorithm!

利用克鲁斯卡尔算法计算最小生成树,以文本形式输出生成树中各条边以及他们的权值。-Using Kruskal minimum spanning tree algorithm to output text in the spanning tree edges and their weights.

我自己做的无向图处理程序可生成最小生成树可遍历生成邻接矩阵邻接表-I do no generate a directed graph traversal process can generate a minimum spanning tree adjacency matrix adjacency list