What is a limitation of Dijkstra's algorithm?

Practice Questions

Q1
What is a limitation of Dijkstra's algorithm?
  1. It cannot find paths in directed graphs.
  2. It cannot handle graphs with negative weights.
  3. It is slower than breadth-first search.
  4. It requires a complete graph.

Questions & Step-by-Step Solutions

What is a limitation of Dijkstra's algorithm?
  • Step 1: Understand what Dijkstra's algorithm does. It finds the shortest path from one point to another in a graph.
  • Step 2: Know that a graph can have edges with different weights, which represent the cost or distance between points.
  • Step 3: Recognize that some graphs can have negative weight edges, meaning the cost to travel between two points can decrease.
  • Step 4: Realize that Dijkstra's algorithm assumes that once it finds the shortest path to a point, it won't find a shorter one later.
  • Step 5: Understand that if there are negative weight edges, Dijkstra's assumption can be wrong, leading to incorrect shortest path results.
No concepts available.
Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely