dijkstra
closed

closed by
2,048 views
0 votes
0 votes
closed with the note: Duplicate:https://gateoverflow.in/81164/dijikstra

Consider a Graph G which contains a negative weight edges but not negative cycles then which of the following statements is TRUE when we run Dijkstra’s algorithm?

  1.   It may not terminate
  2.   It terminates but may produce incorrect results.
    Explanation:
    It always terminates after |e| relaxations and |v| + |e| priority queue operations, but may produce incorrect results
  3.   It never terminates due to cycles in graph
  4.   None of these
closed by

Related questions

0 votes
0 votes
0 answers
1
Elaf asked Jan 22, 2023
310 views
0 votes
0 votes
0 answers
2
gate20232 asked Jan 18, 2023
444 views
2 votes
2 votes
1 answer
3