# Dijkstra’s shortest path algorithm and A* algorithm A Level Resources

## A Level Computer Science: Dijkstra’s shortest path algorithm and A* algorithm

This module contains:

• An editable PowerPoint lesson presentation
• Editable revision handouts
• A glossary which covers the key terminologies of the module
• Topic mindmaps for visualising the key concepts
• Printable flashcards to help students engage active recall
• A quiz with answer key to test knowledge and understanding of the module
##### Compatible with the following examination boards     ## 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:    