Word.ws English Dictionary

Borůvka's algorithm

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.

Proper noun

Borůvka's algorithm

  1. 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.

Questions about Borůvka's algorithm

What does Borůvka's algorithm mean?
Borůvka's algorithm means 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.
What part of speech is Borůvka's algorithm?
Borůvka's algorithm is a proper noun.

Words near Borůvka's algorithm in the dictionary

  1. borzois
  2. Borås
  3. Borðoy
  4. Borôro
  5. Borăscu
  6. Borůvka's algorithm
  7. Borș
  8. Borșa
  9. bos
  10. bos'n
  11. bos'ns

Source and license

Adapted from Wiktionary: Borůvka's algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Borůvka's algorithm.” Word.ws, https://word.ws/bor%C5%AFvka%27s_algorithm. Based on Wiktionary, CC BY-SA 4.0.