TADM2E 6.5

From Algorithm Wiki
Revision as of 18:08, 23 April 2015 by Dentin (talk | contribs) (Replace junk with at least something)
Jump to: navigation, search

In both algorithms, an edge can only ever be picked once, so they will both eventually terminate regardless of negative edge weights. I also suspect that they still generate minimum spanning trees, but don't have a proof of it.