搜索资源列表
模拟退火_生成树
- 模拟退火生成树，一种比较好分类方法。程序简单，易懂。-simulated annealing Spanning Tree, a better classification. Simple and straightforward.
231565262
- 对于个顶点的连通网可以建立许多不同的生成树，每一棵生成树都可以是一个通信网。现在，我们要选择总的耗费最小的那棵树，这就是我们说的最小生成树。本次课程设计就是设计这样的生成树，-for network connectivity can be established in many different spanning tree, every one spanning tree can be a communications network. Now, we have to choose the l
Spanning-tree
- 利用图论中生成树的概念编写的全部生成树代码，由于缺少中间的实数编码遗传算法代码，所以还不能得出完整的结果，但整个程序框架是正确的！-Spanning tree in graph theory using the concept of writing all the spanning tree code, the lack of the middle of the real-coded genetic algorithm code, so it can not come to a complete
FuzzyMST
- 基于模糊费用最小生成树的算法 的源代码 prim算法 模糊数综合排序-Costs based on fuzzy algorithm for minimum spanning tree algorithm source code prim integrated sort fuzzy numbers
guangdusousuo
- 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
Genetic-Algorithm-for-Minimum-SpanningTree
- 使用遗传算法求解最小生成树的编码，C++环境-Genetic Algorithm for Minimum Spanning Tree
tsp
- 多旅行商问题，最小生成树优化。 提供新思路-Multi-traveling salesman problem, minimum spanning tree optimization. To provide new ideas
AGA
- 单点交叉 单点变异 确定式选择法 自适应的遗传算法生成最小树-Adaptive genetic algorithm generates minimum spanning tree
1
- 最小生成树算法-Minimum spanning tree
Steiner
- 遗传算法在Steiner树中的应用 遗传算法的相关论文-In order tO solve the subject of Steiner minimum spanning tree，an adaptive genetic algorithm is introduced．The Steiner minimum spanning tree is transformed into a combination-optimization problem and a triabselection m
stp
- 生成树协议的国际标准是IEEE802.1d。运行生成树算法的网桥/交换机在规定的间隔 （默认2秒）内通过网桥协议数据单元（BPDU）的组播帧与其他交换机交换配置信息 -Spanning Tree Protocol (STP) is a Layer 2 protocol that runs on bridges and switches. The specification for STP is IEEE 802.1D. The main purpose of STP is to ensure t
MST
- Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tr-Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tree
prim
- 用prim算法求最小生成树，只要输入途中两点间权值，直接的结果-With prim for the Minimum Spanning Tree, as long as the power input on the way between two values, a direct result of
minimalspannigtree
- this the minimal spanning tree solution-this is the minimal spanning tree solution
gatree
- 遗传算法解决最小生成树问题,程序包含5个文件，直接运行start即可-This program use GA to solve the problem of minimum spanning tree
C4.5
- 决策树经典学习算法，C4.5算法是ID3算法的改进，加上了子树的信息，因素属性的值可以是连续量,训练例的因素属性值可以是不确定的,对已生成的决策树进行裁剪,减小生成树的规模.-Decision tree learning algorithm of C4.5 algorithm is the classic, the improved ID3 algorithm, coupled with the subtree of the information, the factor attribute v
TSPPrim
- 用最小生成树解决旅行家问题 用到了prim算法 近似算法-Used in the prim algorithm approximation algorithm for minimum spanning tree to solve the problem of travelers
matlab_bgl
- 一个非常全的图论工具箱，含有最短路、生成树等一些列问题的解决函数代码和说明！-A very full toolbox of graph theory, containing the function code and descr iption of the problems of the shortest path, spanning tree, and some column!
Matlab-algorithm-important
- 本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等，带有源程序和中文说明文档，此文件夹中的文件，如需被利用，则要直接放至work目录下。-The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and mini
DirectedSpanningTree
- Spanning tree algorithm and codes