当前位置：
首页 资源下载
搜索资源 - minimum spanning tree
搜索资源列表
-
0下载：
matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。,matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
-
-
0下载：
用A星算法解决TSP问题，其中的择优函数选的是最小生成树-A star with the algorithm to solve TSP problems, the merit function is the minimum spanning tree selected
-
-
0下载：
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
-
-
0下载：
使用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.
-
-
0下载：
最小生成树 的 C语言 程序绝对可以运行，-Minimum spanning tree of the C language program absolutely can run,
-
-
0下载：
数据结构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
-
-
2下载：
//有向图:有向图,无向图基本操作
//运行环境：VC
//有向图,无向图基本操作,包括:
//1、邻接矩阵
//2、邻接表
//3、深度优先遍历
//4、广度优先遍历
//5、最小生成树
//6、拓扑排序
//7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
-
-
0下载：
包括冒泡排序，归并排序，N皇后，最小生成树等经典算法的java实现代码-Including bubble sort, merge sort, N Queen, such as the classic minimum spanning tree algorithm java code
-
-
0下载：
最小生成树问题
问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。
设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。
-The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
-
-
0下载：
自己编的，在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" ,
-
-
0下载：
最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications
-
-
0下载：
最小生成树 MST的四种算法实现。
包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。
复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree
Algorithm
-
-
0下载：
这是一个关于数据结构中最小生成树的源代码，是课程作业。-This is data about the structure of a minimum spanning tree of the source code, programs are operating.
-
-
0下载：
使用遗传算法求解最小生成树的编码，C++环境-Genetic Algorithm for Minimum Spanning Tree
-
-
0下载：
Minimum Spanning Tree implementation using kruskal and prims algorithm.
-
-
0下载：
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.
-
-
0下载：
用A星算法解决的TSP问题，其中的选择函数用的是最小生成树-A star with the algorithm to solve the TSP problems, the selection function using a minimum spanning tree
-
-
0下载：
本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
-
-
0下载：
* 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
-
-
0下载：
用MATLAB实现最小生成树，可以应用在网络分簇、计算权值等多种应用场合-Using MATLAB to achieve the minimum spanning tree, can be applied to network clustering, calculation of weight and many other applications
-
« 12
3
4
5
6
7
8
9
10
...
44
»
