Dijkstras algorithm does not work for graphs in which some weights are negative. A Natural approach to overcome this problem would be the following:
To find a shortest path between two vertices in a graph with some negative weights, determine the minimium weight δ<0 among all the edges of the graph. Add some ε >=-δ to every edge making all weights nonnegative. Run Dijstra's algorith and return the shortest path subtracting ε from the weight of every edge of the path.
Now, Give a counterexample, ie such a graph for which the above approach fails.
any1 kno of a good counter example they can juss describe to me since we cant draw here unelss sum1 knows how