Question

Dijkstra's shortest path algorithm is guaranteed to produce correct results only when the input graph:

Q: Answer-Dijkstra's shortest path algorithm is guaranteed to produce correct results only when the input grap...

Dijkstras algorithm relies on the greedy assumption that once a vertexs shortest distance is finalised, it can never be improved by a later path. This assumption breaks down if the graph contains negative edge weights, since a longer path with a negative-weight edge could later produce a shorter total distance than the one already finalised, making the algorithms results potentially incorrect on such graphs.