Difference between revisions of "TADM2E 6.5"

From Algorithm Wiki
Jump to: navigation, search
(Created page with "Ttttt")
 
(Undo revision 1144 by FuckyouMatt (talk))
 
(6 intermediate revisions by 5 users not shown)
Line 1: Line 1:
Ttttt
+
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.

Latest revision as of 12:10, 2 August 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.