Difference between revisions of "TADM2E 6.7"

Revision as of 10:14, 31 July 2020

Redirect to:

@@ Line 1: / Line 1: @@
-=== Part A ===
+#REDIRECT [[UNTV]]
-Probably yes.  Using Kruskal's algorithm, you'll still get the same insertion order of edges, regardless of how much you add or subtract from the edge weighting.
-=== Part B ===
-No. Example would be the following graph:
-<pre>
-A -1 B
-B -1 C
-A -1 C
-</pre>
-Shortest path from A to C is A->B->C.
-If we increase all weights by two, shortest path will change to A->C