TADM2E 6.5
From Algorithm Wiki
Revision as of 12:10, 2 August 2020 by Matt (talk | contribs) (Undo revision 1144 by FuckyouMatt (talk))
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.
