Back to Discover
🔢

Breadth-first search

math Maturity 11-13

Imagine you are in a maze.

BFS-Algorithm Search Way.gif
BFS-Algorithm Search Way.gif
You want to find the end. You look at every path near you first. Then you look at the next paths. This helps you find the best way out. It is a smart way to search. Can you find your way through a maze?

53 words
🖼️ Images & Media (5)
File:Animated BFS.gif
Animated BFS.gif
File:BFS-Algorithm Search Way.gif
BFS-Algorithm Search Way.gif
File:Tic-tac-toe-game-tree.svg
Tic-tac-toe-game-tree.svg
File:MapGermanyGraph.svg
MapGermanyGraph.svg
File:GermanyBFS.svg
GermanyBFS.svg
Up Next
🔢
Depth-first search
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Depth-first search 0% Prim's algorithm 0% Dijkstra's algorithm 0% Component (graph theory) 0% Bridge (graph theory) 0% Tree (graph theory) 0%

🔬 Go deeper

More advanced topics to explore

Tree (abstract data type) Brute-force search Prim's algorithm Search algorithm

🪜 Step back

Simpler topics to build understanding

Depth-first search Heap (data structure) Red–black tree Queue (abstract data type)
📚 Content adapted from Wikipedia | Readability: FK 11.6 | Vital Level 5