Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03334454n
Noun Concept
SYL
No term available
EN
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. Wikipedia
Relations
Sources
IS A
EN
algorithm
EN
greedy algorithm
DISCOVERER OR INVENTOR
EN
Edsger W. Dijkstra
Vojtech Jarnik
Robert C. Prim
NAMED AFTER
Vojtech Jarnik
Robert C. Prim
USE
EN
decision tree
EN
minimum spanning tree

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