Dijkstra's algorithm finds the shortest path for a given problem. Dijkstra's algorithm can be used to find the shortest route between two cities. This algorithm is so powerful that it not only finds the shortest path from a chosen source to a given destination, it also finds all of the shortest paths from the source to all destinations. Dijkstra's algorithm is widely used in the fields of operational research, computer science and artificial intelligence. The problem requires students to find the shortest a van driver shold take to travel from Milton Keynes to Hoddesdon.
Dijkstra's algorithm: presentation - an introduction to the problem outlining the student task and putting the task into context.
Dijkstra's algorithm: problem - a student version of the problem outlined in the introduction.
Dijkstra's algorithm: solution - one possible suggested solution for the problem.
The OR Society have developed these problems for use in Decision mathematics lessons. The problems can be used as an introduction to a topic, part of the learning process or as a plenary exercise.
Show health and safety information
|Subject(s)||Computing, Algorithmic Thinking, Mathematics|
|Published||2010 to 2019|
|Log in to rate this resource|
- OR Society