Difference between revisions of "TADM2E 6.15"
From Algorithm Wiki
(Recovering wiki) |
(name change) |
||
| Line 1: | Line 1: | ||
| − | Yes. By observation. When using | + | Yes. By observation. When using Kruskal's algorithm you always select the edges with the minimum weight to add to the shortest path. When all weights are increased by one, you'll still select the same edge with this algorithm, therefore, the same shortest path spanning tree will still be found. |
Revision as of 19:06, 23 April 2015
Yes. By observation. When using Kruskal's algorithm you always select the edges with the minimum weight to add to the shortest path. When all weights are increased by one, you'll still select the same edge with this algorithm, therefore, the same shortest path spanning tree will still be found.
