Back to Discover
🔢

Depth-first search

math Maturity 7-9

You can find your way through a maze.

Depth-First-Search.gif
Depth-First-Search.gif
You go down one path as far as you can. If you hit a wall, you turn back. This helps you find the end. It is a smart way to look for things. Do you like mazes?
MAZE 30x20 DFS.ogv
MAZE 30x20 DFS.ogv

49 words
🖼️ Images & Media (6)
File:Depth-First-Search.gif
Depth-First-Search.gif
File:graph.traversal.example.svg
graph.traversal.example.svg
File:Tree edges.svg
Tree edges.svg
File:If-then-else-control-flow-graph.svg
If-then-else-control-flow-graph.svg
File:Graph.traversal.example.svg
Graph.traversal.example.svg
MAZE 30x20 DFS.ogv
Up Next
🔢
Breadth-first search
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Breadth-first search 0% Analysis of algorithms 0% Prim's algorithm 0% Tree (graph theory) 0% Dijkstra's algorithm 0% Kruskal's algorithm 0%

🔬 Go deeper

More advanced topics to explore

Breadth-first search Analysis of algorithms Tree (abstract data type) Prim's algorithm

🪜 Step back

Simpler topics to build understanding

Heap (data structure) Tree (graph theory) Red–black tree Kruskal's algorithm
📚 Content adapted from Wikipedia | Readability: FK 11.5 | Vital Level 5