SLR26: Dijkstra's Shortest Path Algorithm

What is the primary purpose of Dijkstra's Shortest Path Algorithm?

• To find the longest path between two nodes in a graph

• To find the shortest path between one node and all other nodes in a weighted graph

• To sort nodes in a graph

• To find the shortest path in an unweighted graph

Which of the following is a limitation of Dijkstra's Shortest Path Algorithm?

• It cannot handle graphs with more than 100 nodes

• It does not work for edges with negative weight values

• It cannot find paths in unweighted graphs

• It requires a heuristic function

What is the initial distance set for each node in Dijkstra's algorithm?

• Zero

• A very large number, often infinity

• The actual distance from the start node

• The average distance between nodes

Which algorithm is considered a solution to the limitation of Dijkstra's algorithm regarding negative weights?

• A* Algorithm

• Bellman-Ford Algorithm

• Kruskal's Algorithm

• Prim's Algorithm

What is the relationship between Dijkstra's algorithm and the A* algorithm?

• Dijkstra's is a special case of A* with no heuristics

• A* is a special case of Dijkstra's with no heuristics

• They are completely unrelated

• Both are used for sorting data

In which city did Dijkstra develop his algorithm to find the shortest route?

• Amsterdam

• Rotterdam

• Groningen

• Utrecht

Which data structure can be used to implement Dijkstra's algorithm besides a table or array?

• Stack

• Queue

• Linked List

• Binary Tree

What is the shortest distance from the starting node to itself in Dijkstra's algorithm?

• Infinity

• Zero

• One

• The average distance to other nodes

How is infinity represented in Python for Dijkstra's algorithm?

• As a string "infinity"

• Using a very large integer

• Using `float('inf')`

• Using a special infinity object

What type of search is Dijkstra's algorithm considered to be?

• Depth-first search

• Breadth-first search

• Binary search

• Linear search