Home
Random
Log in
Settings
Donations
About Wiktionary
Disclaimers
Search
Borůvka's algorithm
Language
Watch
Edit
English
edit
Proper noun
edit
Borůvka's
algorithm
(
graph theory
)
A
greedy algorithm
for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected.
Categories
:
English lemmas
English proper nouns
English uncountable nouns
English multiword terms
English terms spelled with Ů
English terms spelled with ◌̊
en:Graph theory
English eponyms
Hidden categories:
English terms with non-redundant non-automated sortkeys
English entries with language name categories using raw markup
Pages with 1 entry