Back to Discover
🔢

Kruskal's algorithm

math Maturity 7-9

We can find the best way to connect dots.

KruskalDemo.gif
KruskalDemo.gif
We pick the shortest lines first. We do not make any loops. This helps us save space. It is a smart way to work. Can you find the shortest path?

40 words
🖼️ Images & Media (7)
File:KruskalDemo.gif
KruskalDemo.gif
File:Kruskal Algorithm 1.svg
Kruskal Algorithm 1.svg
File:Kruskal Algorithm 2.svg
Kruskal Algorithm 2.svg
File:Kruskal Algorithm 3.svg
Kruskal Algorithm 3.svg
File:Kruskal Algorithm 4.svg
Kruskal Algorithm 4.svg
File:Kruskal Algorithm 5.svg
Kruskal Algorithm 5.svg
File:Kruskal Algorithm 6.svg
Kruskal Algorithm 6.svg
Up Next
🔢
Prim's algorithm
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Prim's algorithm 0% Dijkstra's algorithm 0% Component (graph theory) 0% Tree (graph theory) 0% Ford–Fulkerson algorithm 0% Bellman–Ford algorithm 0%

🔬 Go deeper

More advanced topics to explore

Prim's algorithm Dijkstra's algorithm Component (graph theory) Heapsort

🪜 Step back

Simpler topics to build understanding

Tree (graph theory) Ford–Fulkerson algorithm BEST theorem Queue (abstract data type)
📚 Content adapted from Wikipedia | Readability: FK 9.9 | Vital Level 5