Borůvka's algorithm
Jump to navigation
Jump to search
English
[edit]Proper noun
[edit]Borůvka's algorithm
- (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.