Kruskal's algorithm
minimum spanning forest algorithm that greedily adds edges
Facts
7 properties- Instance of
- greedy algorithm, graph algorithm[3]
- Publication date
- 1956[5]
- Computes solution to
- minimum spanning tree[6]
- Discoverer or inventor
- Joseph Kruskal[2]
- Named after
- Joseph Kruskal[4]
- Worst-case time complexity
- O(E \log V)[8]
🏷️ Also known as
en Kruskal's algorithm
ar خوارزمية كروسكال
cs Kruskalův algoritmus
de Kruskalalgorithmus
de Algorithmus von Kruskal
de Kruskal-Algorithmus
es algoritmo de Kruskal
fa کروسکال
fa الگوریتم کراسکال
fr algorithme de Kruskal
he אלגוריתם קרוסקל
he האלגוריתם של קרוסקל
hu Kruskal-algoritmus
it algoritmo di Kruskal
ja クラスカル法
ko 크러스컬 알고리즘
ko 크루스칼 알고리즘
nl Algoritme van Kruskal
nl Kruskals algoritme
pl algorytm Kruskala
🔖 Identifiers · 6
- OpenAlex ID
- C63645285
- Image (Wikimedia Commons)
- MST kruskal en.gif ↗
- Dictionary of Algorithms and Data Structures ID
- kruskalsalgo
- Freebase ID
- /m/0f2gx
- Microsoft Academic ID (discontinued)
- 63645285
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Computes solution to 1
Created notable works 1
Discoverer or inventor 1
Instance of 1
Named after 1
Uses 1
Press Enter · cited answer in seconds
0 sources
Summary
Kruskal's algorithm is a greedy algorithm[1].