TADM2E 6.5
From Algorithm Wiki
Revision as of 15:23, 24 July 2020 by Matt (talk | contribs) (Matt moved page EAT BULAGA!!!! to TADM2E 6.5 over redirect: revert)
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.
