Difference between revisions of "TADM2E 6.5"
From Algorithm Wiki
(Created page with "Ttttt") |
(Replace junk with at least something) |
||
| 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 18:08, 23 April 2015
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.
