HomeServicesBlogDictionariesContactSpanish Course
← Back to search

Meaning of Borůvka's algorithm | Babel Free

Noun CEFR B2

Definitions

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.

CEFR level

B2
Upper Intermediate
This word is part of the CEFR B2 vocabulary — upper intermediate level.

See also

Learn this word in context

See Borůvka's algorithm used in real conversations inside our free language course.

Start Free Course