User Tools

Site Tools


This shows you the differences between two versions of the page.

Link to this comparison view

kruskals_algorithm [2015/02/02 08:28] (current)
Line 1: Line 1:
 +====== Kruskal'​s algorithm ======
 +Kruskal'​s algorithm is a greedy 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).
 +[algorithm kruskals]
kruskals_algorithm.txt ยท Last modified: 2015/02/02 08:28 (external edit)