Question was about Single Source shortest path -
We know that Dijkstra may/ may not handle negative edge weights in graph but Bellman Ford can. Also, the time complexity of bellman ford is higher than that of Dijkstra's. Now what if we add a large positive integer to all the weights of the graph, and then simply apply Dijkstra? What is the need of Bellman Ford then?