Given an undirected connected simple graph with distinct edge weights. If we add a constant value to each edge of graph then : single source shortest path of new graph can be changed?
My attempt :
If question was for MST(minimum spanning tree) then it was not changed. Can you explain for SSSP(single source shortest path)?