搜索资源列表
Kruskal.cpp
- 在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
Kruskal算法
- kruskal算法来得到最小生成树的程序-Kruskal algorithm to be the minimum spanning tree procedures
最小生成树 prim算法
- 这是一个用prim算法来得到最小生成树的程序-This is a prim algorithm used to be the minimum spanning tree procedures
crypt111
- 测试Linux从2.4内核开始就非常好的支持了网桥，并且还支持生成树协议等高级应用。加入网桥的物理 端口将不分配IP地址，只有网桥虚拟端口可以分配IP ... 4,修改/etc/sysconfig/network-tests from the Linux kernel 2.4 on the very good start to support the bridge, It also support the Spanning Tree Protocol and other advanced app
MinTree
- 最小生成树的算法，用VC++6.0编写，在控制台上实现-minimum spanning tree algorithm, VC 6.0 preparation, the console to achieve
2120
- kruscal算法求最小生成树算法 欢迎大家使用-kruscal algorithm for the minimum spanning tree algorithm Everyone is welcome to use
MaxSpanningTree
- 求最大生成树，实际上是以最小生成树的算法为基础进行改进，我采用的是kruskal算法，基本思路是对各个边的权进行排序，然后加入生成树，形成环的点跳过，直到生成最大生成树。JAVA的特点是输入输出比较便利，所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algo
prime-tree
- 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method
zuiduanluzuixiaoshengchengshu
- 这是一个求最短路和最小生成树的C++的原代码,经过调试可以在机子上使用.-This is the most short-circuit for a minimum spanning tree and the original C code, after testing the use of loom.
minimalspaningtree
- 生成最小生成树的源代码,对数据结构中图论处理有帮助,有兴趣可以下-minimum spanning tree generation of source code, the data structure graph theory to help deal with are interested can make
zuixiaoshengchengshu23423
- 概要設計 1、程序運\行流程: (1)、提示輸入頂點數目； (2)、接受輸入，按照項目要求產生邊權值的隨機矩陣；然後求解最小生成樹； (3)、輸出最小生成樹並且退出-an outline design, the procedures in process : (1), suggesting that the number of input vertices; (2), accept input, In accordance with requirements of the pro
网的最小生成树问题
- 网的最小生成树问题-net minimum spanning tree problem
demo
- Treeview 控件的精通使用，用其生成树，同时将要保存的节点，保存到list然后，将其清空，点击回显后，让其从新选中。-Proficiency in the use of the Treeview control, using the spanning tree, at the same time to preserve the node, and then save it to list its empty, click back significantly after the re-se
tree_to_sql
- 用delphi Treeview 实现树目录结构，自动生成树，-Delphi Treeview with the realization of the tree directory structure, automatically spanning tree,
MSTParser.tar
- MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent re
mintree
- 用matlab去实现基于dijkstra算法实现最小生成树-Using matlab to dijkstra algorithm based on minimum spanning tree
rhb
- 理解生成树协议STP的配置及原理。 使网络在有冗余链路的情况下避免环路的产生，避免广播风暴等。 -Understanding Spanning Tree Protocol STP configuration and principle. The network in a redundant link, to avoid loop formation, and so to avoid broadcast storms.
minimum-spanning-tree
- 在数据机构中，在图论中，搜索整个图，生成最小生成树。-Data organization, in graph theory, search the entire diagram, generate a minimum spanning tree.
min-tree
- 最小生成树权值计算的源代码，输入结点个数，和各结点之间用三元法表示的权值，利用算法计算最小生成树-Minimum spanning tree weight calculation of the source code, the right to use the ternary notation of the number of input values between nodes, and each node using the minimum spanning tr
Minimum-Spanning-Tree
- Minimum Spanning Tree BY ICA