Problem
Give an example of a weighted directed graph G with negative-weight edges, but no negative-weight cycle, such that Dijkstra's algorithm incorrectly computes the shortest-path distances from some vertex v. Trace the execution of Dijkstra's algorithm to show where it goes awry