Prim's algorithm
algorithm for finding the minimum spanning tree for weighted undirected graphs
Facts
5 properties- Instance of
- algorithm, graph algorithm, greedy algorithm[4][5]
- Discoverer or inventor
- Vojtěch Jarník, Robert C. Prim, Edsger W. Dijkstra[1][2][3]
- Named after
- Robert C. Prim, Vojtěch Jarník[6][7]
- Worst-case time complexity
- O(|E| + |V| \log |V|), O((|V| + |E|) \log |V|) = O(|E| \log |V|), O(|V|^2)
🏷️ Also known as
en DJP algorithm
en Prim's algorithm
en Prim–Jarník algorithm
en Prim–Dijkstra algorithm
en Jarník algorithm
en Jarnik algorithm
ar خوارزمية بريم
cs Primův algoritmus
cs Jarníkův algoritmus
cs DJP algoritmus
de Primscher Algorithmus
de Algorithmus von Jarnik, Prim und Dijkstra
de Prim-Dijkstra-Algorithmus
de Algorithmus von Prim
es Algoritmo de Jarnik
es Algoritmo de Prim
es Algoritmo DJP
fa الگوریتم پریم
fi Primin algoritmi
fr algorithme de Prim
🔖 Identifiers · 4
- OpenAlex ID
- C1649724
- Dictionary of Algorithms and Data Structures ID
- PrimsAlgorithm, PrimJarniacutek, primJarnik
- Freebase ID
- /m/0f2jn
- Microsoft Academic ID (discontinued)
- 1649724
🔗 Connections
Discoverer or inventor 3
Has use 2
Instance of 2
Named after 2
Created notable works 1
Press Enter · cited answer in seconds