Question: Show an example of a small directed weighted graph with positive and negative edge weights in which the Dijkstra algorithm fails to find the shortest

Show an example of a small directed weighted graph with positive and negative edge weights in which the Dijkstra algorithm fails to find the shortest paths correctly. Explain why it fails in that case
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
