Kruskal's algorithm: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

13 November 2023

  • curprev 15:5415:54, 13 November 2023‎ Ai talk contribs‎ 3,188 bytes +3,188‎ Created page with "== Overview == 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). Image:Detail-37243.jpg|thumb|cente..."
Retrieved from "https://canonica.ai/page/Kruskal%27s_algorithm"