Difference between revisions of "TADM2E 6.5"
From Algorithm Wiki
(Replace junk with at least something) |
m (Wacko moved page TADM2E 6.5 to EAT BULAGA!!!!) |
(No difference)
| |
Revision as of 07:28, 18 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.
