Dijkstra and Shortest Path Algorithms for Competitive Exams

Dijkstra and Shortest Path Algorithms - Typical Problems - Competitive Exam Level

Q. In Dijkstra's algorithm, what data structure is commonly used to select the next node with the smallest tentative distance?

Solution

A priority queue is used in Dijkstra's algorithm to efficiently retrieve the node with the smallest tentative distance.

Correct Answer: C — Priority Queue

Q. What is the output of Dijkstra's algorithm if the graph is disconnected?

Solution

Dijkstra's algorithm will return the shortest path to reachable nodes only, while unreachable nodes will have infinite distance.

Correct Answer: B — Shortest path to reachable nodes only

Showing 1 to 2 of 2 (1 Pages)