AQA A’Level SLR05 Graphs traversal algorithms
About this video
AQA Specification Reference
A Level 4.3.1.1
In this video we overview algorithms which can be used to traverse a graph data structure. We cover both breadth-first and depth-first methods.
Key questions:
- How do graphs work?
- How do you create a graph?
- How do you add a data item to a graph?
- How do you remove a data item from a graph?
- How do you traverse a graph?
00:00 Graph traversal algorithms
00:10 Intro
00:14 Traversing, adding to and removing from a graph
00:46 Adding an item to a graph
01:58 Removing an item from a graph
02:36 Traversing a graph
02:54 Traversing a graph using a breadth-first search
08:56 Traversing a graph with a depth-first search
15:52 Comparing breadth-first and depth-first traversal algorithms
16:48 Key questions
17:05 Outro
Last updated: 11.04.25
