A graph's Dijkstra algorithm implementation is returning incorrect shortest path values. What could be a reason? - Study24x7
Social learning Network
2 followers study24x7 28 Aug 2024 10:46 AM study24x7 study24x7

A graph's Dijkstra algorithm implementation is returning incorrect shortest path values. What could be a reason?

A

The graph contains negative edge weights

B

The priority queue is not updated correctly

C

The algorithm stops too early

D

The graph is not strongly connected

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles