搜索资源列表
最小生成树
- 最小生成树.rar-minimum spanning tree. Rar
isTree
- 一个生成树的源程序，不是很复杂，不过用来交一下数据结构的作业还行吧-a spanning tree of the source, is not very complicated, but what used to pay the operating data structure it is also OK
Prim-minimum-spanning-tree-algorithm
- 最小生成树Prim算法。Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可。-Prim minimum spanning tree algorithm. The file of Dandn up and down two rows of numbers corresponding node connected to the name and
Minimum-spanning-tree
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价-The distance between the network to set a region of n cities, Prim' s algorithm or Kruskal' s algorithm to create a minimum spanning tree, and the calculatio
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.
minimum-spanning-tree
- 在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 -Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop,
minimum-spanning-tree_prim
- 用C++实现的最小生成树,使用Prim(普里姆)算法.-C++ achieved with the minimum spanning tree, using Prim (Prim) algorithm.
minimum-spanning-tree_Kruskal
- 一个C++实现的最小生成树,使用的是Kruskal(克鲁斯卡尔)算法.-C++ achieve a minimum spanning tree, using the Kruskal (Kruskal) algorithm.
Minimum-spanning-tree
- 最小生成树，可以实现构建最小生成树的目的。-Minimum spanning tree, you can achieve the purpose of constructing a minimum spanning tree.
kruskal-Minimum-Spanning-Tree
- 普里母和kruskal 生成最小生成树 普里母和kruskal 生成最小生成树 -Minimum Spanning Tree
Minimum-Spanning-Tree
- Minimum Spanning Tree BY ICA
Minimum-Cost-Spanning-Tree
- Minimum Cost Spanning Tr-Minimum Cost Spanning Tree
Spanning-Tree-the-Kruskal-method
- 用C++实现了最新生成树协议，克鲁斯卡尔方法在很多领域都会经常用到，比如操作系统和计算机网络。-C++ implementation of the latest Spanning Tree Protocol, Kruskal methods are often used in many fields, such as operating systems and computer networks.
Minimum-Spanning-Tree-matlab
- 图论中的最小生成树模型，基于MATLAB实现-The minimum spanning tree graph theory model, based on MATLAB implementation
Minimum-Spanning-Tree
- 该源码为图的最小生成树的C++实现，在与图相关的问题中，最小生成树也一直是一个比较热门的话题，该源码能够为对此话题感兴趣的朋友一些参考。-The source code for the minimum spanning tree diagram of the C++ implementation, the problems associated with the FIG, the minimum spanning tree has be
Minimum-Spanning-Tree
- 使用邻接矩阵生成最小生成树的算法，须输入顶点数目，顶点数据以及邻接矩阵的数据。-Adjacency matrix generated minimum spanning tree algorithm, the input data must be the number of vertices, vertex data and adjacency matrix.
minimum-spanning-tree
- 用快速最小生成树使用k-均值方法进行医学图像分割-Medical image segmentation using k- mean value method for fast minimum spanning tree
minimum-spanning-tree
- 用c语言编写的最小生成树算法kruskal和prim-Using c language Minimum Spanning Tree Algorithm prim and kruskal
ypap116-minimum-spanning-tree
- basic code for spanning tree
SPANING_27BIT
- spanning tree adder writtern vHDL Code