Give an example of a weighted directed graph G withnegative-weight edges, but no negative-weight cycle, such thatDijkstra’s algorithm incorrectly computes the shortest-pathdistances from some vertex v. Trace the execution of Dijkstra’salgorithm to show where it goes awry.
Solution