Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:minimum_spanning_tree_algorithm |
| gptkbp:alsoKnownAs |
gptkb:Prim's_algorithm
gptkb:Jarník's_algorithm |
| gptkbp:application |
clustering
approximation algorithms network design |
| gptkbp:category |
greedy algorithm
|
| gptkbp:complexity |
O(E + V log V)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstPublished |
gptkb:Vojtěch_Jarník
1930 |
| gptkbp:independentlyRediscoveredBy |
gptkb:Robert_C._Prim
gptkb:Edsgar_Dijkstra |
| gptkbp:input |
connected weighted undirected graph
|
| gptkbp:namedAfter |
gptkb:Robert_C._Prim
gptkb:Vojtěch_Jarník |
| gptkbp:output |
minimum spanning tree
|
| gptkbp:relatedTo |
gptkb:Kruskal's_algorithm
gptkb:Borůvka's_algorithm |
| gptkbp:solvedBy |
minimum spanning tree problem
|
| gptkbp:usesDataStructure |
gptkb:heap
priority queue |
| gptkbp:bfsParent |
gptkb:Vojtěch_Jarník
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Jarník–Prim algorithm
|