Which of the following is NOT a limitation of Dijkstra's algorithm?
Practice Questions
Q1
Which of the following is NOT a limitation of Dijkstra's algorithm?
It cannot handle negative weight edges
It is not suitable for dense graphs
It finds the shortest path from a single source
It can be inefficient for large graphs
Questions & Step-by-Step Solutions
Which of the following is NOT a limitation of Dijkstra's algorithm?
Step 1: Understand what Dijkstra's algorithm does. It finds the shortest path from one starting point (source) to all other points (nodes) in a graph.
Step 2: Identify the limitations of Dijkstra's algorithm. Common limitations include: it cannot handle negative weight edges, it only works with graphs that are connected, and it is not efficient for very large graphs.
Step 3: Determine what is NOT a limitation. Since finding the shortest path from a single source to all other nodes is a primary function of Dijkstra's algorithm, this is NOT a limitation.
