Graphs and Dijkstra’s algorithm lesson for Cambridge International AS & A Level Computer Science (9618): a free lesson with editable PowerPoint slides and a student worksheet. A graph links nodes with edges, and Dijkstra’s algorithm finds the shortest path between nodes by working through weighted edges.
This free version includes the slides and the student worksheet. The answers are not included.
Get the full lesson- With full answers: Graphs and Dijkstra’s algorithm – A Level Computer Science 9618
- The whole topic: Artificial intelligence – A Level CS 9618 (5 lessons)
Last updated: November 2026.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have downloaded this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£0.00