Show that Dijkstra’s algorithm may not work if edges can
Chapter , Problem 24E(choose chapter or problem)
Floyd’s algorithm, displayed as Algorithm 2, can be used to find the length of a shortest path between all pairs of vertices in a weighted connected simple graph. However, this algorithm cannot be used to construct shortest paths. (We assign an infinite weight to any pair of vertices not connected by an edge in the graph.)
Show that Dijkstra’s algorithm may not work if edges can have negative weights.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer