Devora
Assessments

Dijkstra's Algorithm Assessment

Check your knowledge of shortest-path graph algorithms.

AlgorithmsMedium

Question 1

What data structure is commonly used to pick the next node in Dijkstra's algorithm?

Question 2

What is the time complexity of Dijkstra with a binary heap?

Question 3

Dijkstra's algorithm works correctly with negative edge weights.

Question 4

Which value is initialized to 0 for the start node?