Dijkstra's algorithm (shortest path)
Computer Science · Algorithms
Loading practice question…
About this practice set
Dijkstra's algorithm (shortest path) is part of Computer Science (Algorithms). Questions are generated with new numbers each time you practise. Levels available: Easy. After you answer, an explanation is shown.
Example questions
A taste of what you will practise. Answers are revealed after you try.
Easy
What does Dijkstra’s algorithm find?
- The shortest path in a weighted graph
- The longest path
- Any path
- The largest cycle