Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03334454n
Noun Concept
Categories: Graph algorithms, Greedy algorithms, Spanning tree
EN
Prim's algorithm  DJP algorithm  Jarnik's algorithm  Jarnik algorithm  Jarniks algorithm
EN
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. Wikipedia
Definitions
Relations
Sources
EN
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. Wikipedia
Algorithm Wikidata
IS A
algorithm
greedy algorithm
DISCOVERER OR INVENTOR
Edsger W. Dijkstra
Vojtěch Jarník
Robert C. Prim
NAMED AFTER
Vojtěch Jarník
Robert C. Prim
USE
decision tree
minimum spanning tree
Wikipedia
EN
Prim's algorithm
Wikidata
EN
Prim's algorithm
Wikipedia Redirections
EN
DJP algorithm, Jarnik's algorithm, Jarnik algorithm, Jarniks algorithm, Jarník's algorithm, Jarník-Prim, Jarník algorithm, Jarníks algorithm, Prim-Jarnik, Prim-Jarnik's algorithm, Prim-Jarnik algorithm, Prim-Jarník, Prim-Jarník algorithm, Prim algorithm, Prims algorithm, Prim’s algorithm
Wikidata Alias
EN
DJP algorithm, Jarnik algorithm, Jarník algorithm, Prim–Dijkstra algorithm, Prim–Jarník algorithm

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License