What is Breadth-First Search? A Gentle Introduction to AI Problem Solving and Shortest Paths

An explanation of what Breadth-First Search is for beginners. We will gently introduce the differences from DFS, how queues ...
TES

Graph algorithms: BFS, DFS, Prim's algorithm, Kruskal's algorithm - Cambridge IGCSE & A-Level 9618 |

Also suitable for AQA GCSE Computer Science, OCR GCSE Computer Science, Edexcel Computer Science and A-Level Computer Science teachers. Save hours of lesson planning with this fully resourced, ...