Revision as of 16:26, 12 October 2010 edit Rps (talk \| contribs) Extended confirmed users 607 edits No edit summary ← Previous edit		Revision as of 20:37, 23 June 2013 edit undo Falcongl (talk \| contribs) 48 edits →Why should we limit the input to graphs with distinct edge weights?: new section Next edit →
Line 129: Some of this can definitely be used to expand the article. However, there are some consistent problems in tone that I think prevent it from being immediately useful. I've moved the contribution here to keep it visible, but I will remove it from the article. [[User:Michael Slone\|Michael Slone]] ([[User talk:Michael Slone\|talk]]) 02:35, 15 January 2009 (UTC) == Why should we limit the input to graphs with distinct edge weights? == Observe that none of the steps in the algorithm depends on the constraint that the edge weights are distinct in the graph. I suggest to remove that assumption and edit the content accordingly, i.e. the MST might not be unique. [[User:Falcongl\|Falcongl]] ([[User talk:Falcongl\|talk]]) 20:37, 23 June 2013 (UTC)

Talk:Borůvka's algorithm: Difference between revisions