文件名称:Kruskal
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:13.6kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
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.
This algorithm first appeared in Proceedings of the American Mathematical Society, pp. 48–50 in 1956, and was written by Joseph Kruskal.
Other algorithms for this problem include Prim s algorithm, Reverse-Delete algorithm, and Borů vka s algorithm.
This algorithm first appeared in Proceedings of the American Mathematical Society, pp. 48–50 in 1956, and was written by Joseph Kruskal.
Other algorithms for this problem include Prim s algorithm, Reverse-Delete algorithm, and Borů vka s algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Kruskal/
Kruskal/classes/
Kruskal/classes/Edge.class
Kruskal/classes/Krsub.class
Kruskal/classes/Kruskal.class
Kruskal/classes/Kruskal.htm
Kruskal/classes/Node.class
Kruskal/Kruskal.jcd
Kruskal/Kruskal.jcp
Kruskal/Kruskal.jcu
Kruskal/Kruskal.jcw
Kruskal/src/
Kruskal/src/Krsub.java
Kruskal/src/Kruskal.java
Kruskal/src_kruskal.txt
Kruskal/classes/
Kruskal/classes/Edge.class
Kruskal/classes/Krsub.class
Kruskal/classes/Kruskal.class
Kruskal/classes/Kruskal.htm
Kruskal/classes/Node.class
Kruskal/Kruskal.jcd
Kruskal/Kruskal.jcp
Kruskal/Kruskal.jcu
Kruskal/Kruskal.jcw
Kruskal/src/
Kruskal/src/Krsub.java
Kruskal/src/Kruskal.java
Kruskal/src_kruskal.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.