Borůvka's algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Proper noun[edit]

Borůvka's algorithm

  1. (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.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Borůvka%27s_algorithm&oldid=71616543"