159. OCR A Level (H446) SLR26 – 2.3 A star pathfinding revisited
About this video
This video takes another look at the A* pathfinding algorithm and provides extra clarification regarding its ability to find the shortest route between two nodes of a weighted graph.
Last updated: 27.02.25
Other videos on this course
-
155. OCR A Level (H446) SLR26 – 2.3 Implement merge sort
-
156. OCR A Level (H446) SLR26 – 2.3 Implement quick sort
-
157. OCR A Level (H446) SLR26 – 2.3 Dijkstra’s shortest path
-
158. OCR A Level (H446) SLR26 – 2.3 A star pathfinding
-
160. OCR A Level (H446) SLR26 – 2.3 Measures and methods to determine efficiency of algorithms