Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03334338n
Noun Concept
SYL
No term available
EN
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. Wikipedia
Relations
Sources
IS A
EN
greedy algorithm
DISCOVERER OR INVENTOR
Joseph Kruskal
NAMED AFTER
Joseph Kruskal
SOLVES
EN
minimum spanning tree
USES
EN
disjoint-set data structure

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