Give Simple Example Directed Graph Negative Weight Edges Dijkstra S Algorithm Produces Inc Q37233166

Give a simple example of a directed graph with negative weightedges for which Dijkstra’s algorithm produces incorrect answers.Why doesn’t the proof of Theorem 24.6 go through whennegative-weight edges are allowed? NO NEGATIVE WEIGHT CYCLES!!

Answer

n

OR

 

OR