搜索资源列表
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.
Kruskal
- 贪心法是解决某些优化问题的一种策略。假设我们可以通过一系列的决策来解决某个问题。贪心法使用如下的方法:在每个阶段做出的决策都是局部最优的决策。对于某些问题,这些局部最优解最终成为全局最优解。-Generation of minimum spanning tree algorithm Kruskal
xiansubway
- 一种C++环境下简单的西安地铁规划最小生成树(站点选自西安地铁234号线路)-Simple in of a C++ environment Xi' an Metro Planning minimum spanning tree (site selected from the Xi' an Subway 234 lines)
kruskal
- 最小生成树 用c++实现的,用的是kruskal算法实现的-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
zuixiaoshengchengshu
- 最小生成树C语言程序,提供给喜欢编程以及数学建模的同学-Minimum spanning tree C language program
prim1
- 最小生成树中prim算法的matlab代码,此算法可处理大数据的分类。-Prim minimum spanning tree algorithm matlab code, this classification algorithm can handle large data.
greedy-algorithm
- 克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为简单理解的一个。这里面充分体现了贪心算法的精髓。-Kruskal algorithm (Kruskal' s algorithm) is relatively simple to understand one of two classic minimum spanning tree algorithm. Inside this fully reflects the essence of greedy a