Kruskal's algorithm
Description: Kruskal's algorithm is a greedy graph algorithm that finds a minimum spanning tree by adding edges in increasing order of weight without creating cycles.
Primary topic: Complexity and Algorithms in Graphs (39%)
Related topic: Complexity and Algorithms in Graphs (39%)
Wikidata ID: wiki/Q797860
OpenAlex ID: keywords/kruskal-s-algorithm
