搜索资源列表
LL_Path_optimization
- 【系统功能】 LL-路径优化系统主要用于求解已知坐标的规模为N的城镇间最短路径问题。 【主要算法】 1：利用Prim算法求解带约束条件的连通图的最小生成树； 2：利用基于单亲遗传算法求解带约束条件的TSP问题。 -【Function】 LL-path optimization system is mainly used to solve the known coordinates for the N scale of
UNIXbaogao
- 在一个半径为R的监测区域，随机分布有M个节点，每个节点的感应半径为r，请完成： （1）建立节点的位置信息文件 （2）建立网络的拓扑信息文件 （3）输出最佳路由即最小生成树 -Radius of R in a monitoring region, a random distribution of M nodes, each node of the sensor radius r, please complete: (1)
MST
- Minimum Spanning Tree implementation using kruskal and prims algorithm.
the_tree
- matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。-matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
Graph_Theory
- 图论模型及方法 搞计算机算法和数学建模的人都知道图论是一个很重要的内容。本资料介绍了图论中的最短路算法、匹配、邮递员和货郎问题、最小生成树、网络流等经典问题。而且有非常经典易懂的Matlab程序。-Graph theory and methodology of engaging in computer algorithms and mathematical modeling of the people know that graph t
Minimum_Spanning_Tree
- Minimum spanning tree.cpp If You have a connected, undirected graph, a spanning tree of that graph is a subgraph which is a tree and connects all the vertices together. Here You can do it with in C++ Language.
MPI-GraphTheory
- 图论部分的MPI源码，包括传递闭包、连通分量、最短路径和最小生成树，附带说明和测试用例-Graph Theory part of the MPI source code, including the transitive closure, connected components, shortest path and minimum spanning tree, with instructions and test cases
AGA
- 单点交叉 单点变异 确定式选择法 自适应的遗传算法生成最小树-Adaptive genetic algorithm generates minimum spanning tree
ShortestPath
- 用A星算法解决的TSP问题，其中的选择函数用的是最小生成树-A star with the algorithm to solve the TSP problems, the selection function using a minimum spanning tree
TSP
- 用A星算法解决TSP问题，其中的择优函数选的是最小生成树-A star with the algorithm to solve TSP problems, the merit function is the minimum spanning tree selected
PSO
- matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS 前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。 如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimizati
Optimum-ratio-spanning-tree
- 本压缩程序为最优比例生成树算法的实现程序，代码完整。-The compression program is the realization of the optimal ratio of Spanning Tree Algorithm, code integrity.
KRUSKAL
- * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge wi
surge
- surge apllicationA common application of sensor networks is to sample a sensor periodically (e.g., light or temperature) and report readings to a base station, which is typically a node with a wired network connect
MATLAB_MST
- 用MATLAB实现最小生成树，可以应用在网络分簇、计算权值等多种应用场合-Using MATLAB to achieve the minimum spanning tree, can be applied to network clustering, calculation of weight and many other applications
PrimGraph
- Prim´ s algorithm using graphics finds a minimum spanning tree for a connected weighted undirected graph.
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
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
- 网的邻接矩阵存储（数组表示）、简单输出，最小生成树，采用Prim算法实现最小生成树。-Network adjacency matrix storage (array representation), a simple output, minimum spanning tree, minimum spanning tree using Prim algorithm.
minimalspannigtree
- this the minimal spanning tree solution-this is the minimal spanning tree solution