Location:
Search - kruskal
Search list
Description: kruskal.rar
用于数据计算与出具处理
一种算法-kruskal.rar for data calculation and issued a treatment algorithm
Platform: |
Size: 1024 |
Author: haboy |
Hits:
Description: Kruskal避圈算法的matlab实现-Kruskal algorithm matlab circle to avoid the realization of
Platform: |
Size: 1024 |
Author: shangsheng |
Hits:
Description: kruskal算法 很经典的 使用C语言实现，在数据结构中很实用-Kruskal algorithm is a classic use of C language, data structure in a very practical
Platform: |
Size: 1024 |
Author: changzhuo |
Hits:
Description: 用Java实现Kruskal算法
很详细，适合初学者-Using Java to achieve Kruskal algorithm in great detail, suitable for beginners
Platform: |
Size: 4096 |
Author: 小满 |
Hits:
Description: 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
Platform: |
Size: 101376 |
Author: 傅山 |
Hits:
Description: 最小生成树问题
问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。
设计要求：利用克鲁斯卡尔算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。
-The issue of minimum spanning tree problem Description: n To set up a communication network between cities, only need to set up n-1 lines can be. How to minimize the economic costs of building the communications network is a network of minimum spanning tree problem. Design requirements: the use of Kruskal algorithm for minimum spanning tree network to the text of the various forms of output spanning tree edges and their weights.
Platform: |
Size: 196608 |
Author: 利莉 |
Hits:
Description: Kruskal求最小生成树算法 . 详细中文注释, 易于理解!-Kruskal for minimum spanning tree algorithm. Detailed English notes, easy to understand!
Platform: |
Size: 2048 |
Author: Jiandong Yang |
Hits:
Description: 适于java初学者看的Kruskal算法，用数组做的-Java for beginners to see the Kruskal algorithm, using an array to do
Platform: |
Size: 1024 |
Author: Calvin Chen |
Hits:
Description: 数据结构课程设计据结构课程设计范例\Prim-Kruskal-Dijkstra.rar-Data structure, according to the structure of curriculum design curriculum design examples \ Prim-Kruskal-Dijkstra.rar
Platform: |
Size: 44032 |
Author: zhang fei |
Hits:
Description: matlab实现的prim算法和kruskal算法-prim and kruskal made by matlab
Platform: |
Size: 2048 |
Author: 李小龙 |
Hits:
Description: kruskal算法（附注释）：将边按照权值由小到大排列，然选取一条边，如果和前面的边一起不能构成环则加入该边，否则舍弃改变，执行下一条边，这里的环就是由集合来表示的，nodes[i]=j 表示i节点的顶点时j，-kruskal algorithm (annotated): the edge of the right in accordance with the value of small to large order, ran select an edge, if and front edges are added together do not constitute part of the edge, otherwise discard changes, the next one edge, where the ring is expressed by the collection of, nodes [i] = j that when the vertex i node j,
Platform: |
Size: 1024 |
Author: Aeon |
Hits:
Description: 数据结构中经典的Kruskal算法的java实现，Java版-Data structure in the classical Kruskal algorithm java implementation, Java Edition
Platform: |
Size: 2048 |
Author: happywh wang |
Hits:
Description: kruskal 算法的c++实现,你可以很好的使用，数据结构的只是看它-kruskal it maybe useful to,you can see it
Platform: |
Size: 55296 |
Author: li |
Hits:
Description: 克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为的该算法的代码进行了综合和改进，把各个版本存在的简单理解的一个。本程序对网上的很多版本错误都进行了改正，并用多个例子进行测试。欢迎大家找出错误。-Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning tree for each connected component). Kruskal s algorithm is an example of a greedy algorithm.
Platform: |
Size: 4096 |
Author: qinxiangju |
Hits:
Description: 采用Kruskal算法求最小生成树主要数据结构
edgeset GE 存放图中的所有边
int n,int e 存放图中的顶点数与边数
edgeset C 存放生成树中的边
vexlist gv 图中结点的顶点值
adjmatrix s 用来处理图中结点的查找与合并
int m1,m2 一条边上两顶点所属集合的序号
int k 最小生成树中的边数
int d //图中待扫描边元素的下标-For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript
Platform: |
Size: 2048 |
Author: mgh |
Hits:
Description: 克鲁斯卡尔算法，实现最小生成树，并且可以通过参数控制连通分支的数量-Kruskal algorithm for minimum spanning tree and connected components can be controlled by the number of parameters
Platform: |
Size: 35755008 |
Author: |
Hits:
Description: The classic kruskal algorithm is implemented
Import: adjacency matrix
Output: Minimum spanning tree
Platform: |
Size: 1024 |
Author: 曾经的故事
|
Hits:
Description: 最小生成树之kruskal算法的概念及其实现
kruskal算法的精髓在于：
每次选取一条边。
该边同时满足：1、在当前未选边中权值最小；2、与已选边不构成回路。
直到选取n-1条表是算法结束。找到MST活判断不存在MST。(The concept and implementation of Kruskal algorithm for minimum spanning tree
The essence of Kruskal algorithm lies in:
Select one edge at a time.
At the same time, it satisfies: 1, the minimum weight in the current unselected edge; 2, and the selected side does not constitute the loop.
Until the N-1 table is selected, the algorithm is finished. Find MST alive and judge that there is no MST.)
Platform: |
Size: 11264 |
Author: cuihuiling
|
Hits:
Description: kruskal 算法，需要输入边和权值的向量。顶点数为m的 m乘m大小的上三角矩阵，
并且 没有权值的顶点之间关系的权值等于50(Kruskal algorithm, the vector that requires the input edge and the weight value. M multiplied by the M size of the upper trigonometric matrix with the vertex number of M,
And the weight of the relation between the vertices of no weight is equal to 50)
Platform: |
Size: 1024 |
Author: 海底月
|
Hits:
Description: 在一个给定网络拓扑中求最小生成树的Kruskal算法。(Kruskal Algorithm for Minimum Spanning Tree in Matlab)
Platform: |
Size: 460800 |
Author: BettyBetter |
Hits:
«
1
23
4
5
6
7
8
9
10
...
28
»