Difference between revisions of "TADM2E 6.5"
From Algorithm Wiki
m (Wacko moved page TADM2E 6.5 to EAT BULAGA!!!!) |
m (Matt moved page EAT BULAGA!!!! to TADM2E 6.5 over redirect: revert) |
(No difference)
| |
Revision as of 15:23, 24 July 2020
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.
