Borůvka's algorithm

proper noun

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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. graph theoryA 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.
Cite this entry
APA

Borůvka's algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Bor%C5%AFvka's%20algorithm

MLA

“Borůvka's algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Bor%C5%AFvka's%20algorithm. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Borůvka's algorithm,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Bor%C5%AFvka's%20algorithm.

Source: Borůvka's algorithm on Wiktionary, CC BY-SA 4.0.