Difference between revisions of "TADM2E 6.5"

Revision as of 23:31, 27 July 2020 (view source) Matt (talk \| contribs) m (Matt moved page TADM2E 6.8 to TADM2E 6.5 over redirect: revert) ← Older edit		Revision as of 02:11, 2 August 2020 (view source) FuckyouMatt (talk \| contribs) (Blanked the page) Newer edit →
Line 1:		Line 1:
−	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.	+

Revision as of 02:11, 2 August 2020