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 start vertex v. Use the algorithm version from the handout.
A four-vertex example is possible. Draw the graph, mention the start vertex, show the result
of Dijkstra’s algorithm, and point out for which vertex the result is incorrect.