borůvka's algorithm

Fetched 2026-10-26 (cache).

Synonyms: boruvka's algorithm

Antonyms: boruvka's algorithm

Related words from Datamuse; suggestions, not definitions.

Proper noun

1. {{lb|en|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.

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.