- Adding a constant to every edge weight does not change the solution to the single-source shortest-paths problem. Solution - False
I think this should be True, as Dijkstra's Algorithm sums the paths from source to each vertex. If every edge weight is increased by a constant, then nothing should be changed if all edges are positive. If some edges are negatives, then I don't know if Dijkstra's Algorithm still applies here.
- Adding a constant to every edge weight does not change the solution to the MST problem. (I don't have the solution for this)
I think this is True for the same reason above.
Can someone confirm on this?