Borůvka's algorithm

English dictionary entry

Meanings

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

Word forms

Borůvka's algorithm
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.