Content deleted Content added
m Open access bot: hdl added to citation with #oabot. |
As described in the Pseudocode section, in case of equal weights we need a trivial modification to the algorithm. Many other graph algorithms similarly don't work as given when some edges are equal, but consistent tie-breaking is always assumed. There is no need to confuse people in the first sentence of the article. |
||
Line 2:
{{graph search algorithm}}
'''Borůvka's algorithm''' is 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.
| |||