搜索资源列表
FFF
- 用Kruskal算法求最小生成树，算法与分析实验-Using Kruskal algorithm for minimum spanning tree, Algorithm and Analysis of Experiments
kruskal
- 学数据结构的同学可以看看，这是最小生成树的另一种方法-Data structure of the students can see that this is the minimum spanning tree Another method
code
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-sheet for the storage structure, to achieve connected undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, r
Kruskai
- 用C语言写的最小生成树的算法，方便大家借鉴学习-The minimum spanning tree algorithm, written in C language to facilitate learn from
shujujiegou
- 最小生成树的数据结构解法，若要在n个城市之间建设通信网络，只需要架设n－1条线路即可。如何以最低的经济代价建设这个通信网-The data structure of the minimum spanning tree solution, To the construction of communications networks, and only need to set up the n-1 lines can be between the n cities. The communicatio
softdesign28
- 此文档是描述最小生成树的各种算法的生成过程的相应的说明-The document describes the minimum spanning tree algorithm generation process
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve