A Level Computer Science: Dijkstra’s shortest path algorithm and A* algorithm
This module contains:
Compatible with the following examination boards
Download A Level Module 56: Dijkstra’s shortest path algorithm and A* algorithm
This download is exclusively for Teach Computer Science subscribers!
To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!
Already a member? Log in to download.
Dijkstra’s shortest path algorithm and A* algorithm
Breadth-first traversal technique is used for finding the shortest path between two nodes. Similar to breadth-first search, Dijkstra’s algorithm is also used to find the shortest path between two nodes. This algorithm is used for weighted graphs. For example, if the nodes represent places, the weights may present the distance between the places or the time taken to travel. This algorithm is implemented using a priority queue. This algorithm is also used in networking for routing packets through the shortest path.
This A Level Computer Science module introduces Dijkstra’s shortest path algorithm and A* algorithm to your students, explaining:
- Dijkstra’s algorithm for finding the shortest path between nodes in a graph
- A* algorithm for finding the shortest path to the goal node
More Algorithms Modules
Dijkstra’s shortest path algorithm and A* algorithm is one lesson in our Algorithms module. The other theory lessons can be found below:
