Rare card
Kruskal's algorithm
- Value
- 50 W
- Attack
- 257
- Defence
- 206
- Players
- 1
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree. It is a greedy algorithm that in each step adds to the forest the lowest-weight edge that will not form a cycle.
Get Kruskal's algorithm in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack