Dijkstra's Algorithm Shortest Path on Weighted Graphs

why dijkstras fails in negative weight edges?
can we not shift all the values by same positive number

Shift all values?
You aren’t allowd to modify distances, and -ve numbers have a completely different impact on distances. So cant ddo what you are saying