Definitions from Wiktionary (Borůvka's algorithm)

▸ noun:  (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.


▸ Words similar to Borůvka's algorithm
▸ Usage examples for Borůvka's algorithm

▸ Idioms related to Borůvka's algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Borůvka's algorithm
▸ Rhymes of Borůvka's algorithm

▸ Invented words related to Borůvka's algorithm