搜索资源列表
the_tree.rar
- matlab实现的最小生成树的两种最基本的算法即Kruskal,Prim。,matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
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
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
Minimum-spanning-tree
- Kruskal算法和Prim算法 任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing G tree called G of the spannin
minimum-spanning-tree
- 使用C#图形界面生成最小生成树,核心算法使用Prim算法。图的形状可以在源文件中的图定义处修改。-C# graphical interface to generate a minimum spanning tree, the core algorithm using Prim algorithm. The graph shape defined in the source file in Figure modify.
graph
- 数据结构C对图的操作算法,有广度、深度优先遍历,拓扑排序,最短路径的实现算法,最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
kruskalMinSpanningTree
- This kruskal Minimum Spanning Tree!It s good for user in Coding Programming.-This kruskal Minimum Spanning Tree! It s good for user in Coding Programming.
Minium_Spanning_Tree(Kruskal)
- 最小生成树问题 问题描述:若要在n个城市之间架设通讯网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通讯网,是一个网的最小生成树问题。 设计要求:利用克鲁斯卡尔算法求网的最小生成树;以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
minimal_spanning_tree(Prims)
- 最小生成树问题 问题描述:若要在n个城市之间架设通讯网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通讯网,是一个网的最小生成树问题。 设计要求:利用Prims算法求网的最小生成树;以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
prim
- 自己编的,在VB中实现普里姆最小生成树算法的代码,有图的,边的权值是随机生成的,5个节点,点“generate tree”,就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" ,
Prim-minimum-spanning-tree-algorithm
- 最小生成树Prim算法的matlab文件,无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications
zuixiaoshengchengshu
- 这是一个关于数据结构中最小生成树的源代码,是课程作业。-This is data about the structure of a minimum spanning tree of the source code, programs are operating.
Genetic-Algorithm-for-Minimum-SpanningTree
- 使用遗传算法求解最小生成树的编码,C++环境-Genetic Algorithm for Minimum Spanning Tree
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 the problem of the shortest p
MST
- Minimum Spanning Tree implementation using kruskal and prims algorithm.
AGA
- 单点交叉 单点变异 确定式选择法 自适应的遗传算法生成最小树-Adaptive genetic algorithm generates minimum spanning tree
PSO
- matlab 遗传算法GA,粒子群算法PSO,蚁群算法AS 前段时间上智能计算方法实验课上,自己做的程序。帖到这里,希望有人能改进它们,交流经验这样更有价值。 遗传算法解决最小生成树问题,PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。 如果有宝贵经验希望能交流一下,谢谢,-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm f
Optimum-ratio-spanning-tree
- 本压缩程序为最优比例生成树算法的实现程序,代码完整。-The compression program is the realization of the optimal ratio of Spanning Tree Algorithm, code integrity.
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序,代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
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 with minimum weight from S o