搜索资源列表
最小生成树的示例程序
- 利用克鲁斯卡尔算法求网的最小生成树 是关于数据结构的课程设计的题目 是非常有用的-Kelushikaer algorithm for the use of the network is the minimum spanning tree data structure of the curriculum design is the subject of very useful
生成树
- 一个最小生成树,包括prim算法,可以生成一个最小生成树-a minimum spanning tree, including Prim algorithm can generate a minimum spanning tree
pri算法
- 这是一个数据结构的课程设计采用最小生成树的ＰＲＩＭ算法-This is a data structure courses designed using the minimum spanning tree algorithm PRIM
MinTreee
- 最小生成树源码，按照所提供参数即可返回结果-minimum spanning tree, in accordance with parameters provided by the results can be returned to the
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the out
最小生成树问题
- 最小生成树的数据结构解法，若要在n个城市之间建设通信网络，只需要架设n－1条线路即可。如何以最低的经济代价建设这个通信网-minimum spanning tree data structure solution, if a n cities between building communications networks needed to put up only n-1 line can be. How the lowest economic cost of building the com
zuixiaoshengchengshu
- 1． 掌握最小生成树的基本概念。 2． 掌握求最小生成树的方法。 创建一个邻接表用来存放带权图。 -1. Grasp the basic concept of minimum spanning tree. 2. To master the methods for minimum spanning tree. Create an adjacent table used to store with the right plan.
prim
- 对于网络，其生成树中的边也带权，将生成树各边的权值总和称为生成树的权，并将权值最小的生成树称为最小生成树（Minimun Spanning Tree），简称为MST。 Prim算法的基本思想是： (1) 在图G=(V, E) （V表示顶点 ，E表示边）中，从集合V中任取一个顶点（例如取顶点v0）放入集合 U中，这时 U={v0}，集合T(E)为空。 (2) 从v0出发寻找与U中顶点相邻（另一顶点在V中）权值最小的边的另一顶点v1，并使v1加入U。即U={v0,v1 }
Olympic
- 奥运场馆的规划问题。各场馆位置分散，根据Prim算法求最小生成树，这是算法主体-Planning of the Olympic venues. Various venues in scattered locations, according to Prim minimum spanning tree algorithm is seeking, which is the main algorithm
PrimTomin
- 用普里姆(Prim)算法构造最小生成树。是数据结构中的经典试题-With Prim (Prim) Constructing Minimum Spanning Tree Algorithm
rrrrrrr
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
tubianliyanshi
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
prim
- 输入任意的一个网，用普里姆(Prim)算法构造最小生成树。-Enter any one network, with the prim (Prim) algorithm to construct minimum spanning tree.
Minimum-tree
- 最小生成树，对数据结构新手有用，比较简单 -Minimum spanning tree
prim
- 基于最小生成树定理实现图最小生成树的prim算法-Implementation plan based on the theorem of minimum spanning tree minimum spanning tree algorithm prim
littletree
- 采用加边法实现网络中的生成最小生成树，是数据结构里面关于图论的内容的实现。-Bordered method used to achieve the formation of minimum spanning tree network, which is a data structure diagram of the contents on the implementation.
exam3
- 该程序是对树进行先深、先广遍历，请在此基础上，改为处理指定图，求该图从指定结点出发的先深、先广遍历生成树。-The tree program is the first deep, wide first traversal, in this basis, to handle the specified map, find the graph starting from the specified node of the first deep, wide traverse the spanning
minimum-spanning-tree
- 最小生成树 掌握图的概念及工作原理，运用其原理完成上述实验题目中的内容。 -To grasp the concept of minimum spanning tree diagram and working principle, the use of the principle of the above experimental subject content.
tree
- 自己用C++编写的一个简单的关于最小生成树问题的-With C++ prepared for a minimum spanning tree
Minimum-Cost-Spanning-Tree
- Minimum Cost Spanning Tr-Minimum Cost Spanning Tree