Graphtraverse

This section explains the concept, its importance, and when to use it.

Graphtraverse

bfs

What is it good for?

Breadth-first search

In artificial intelligence / machine learning it can prove to be very important: robots can discover the surrounding more easily with BFS than DFS

dfs

The algorithmic approach and key insights for solving this problem.

Depth-first search is a widely used graph traversal algorithm besides breadth-first search

Depth-first search

Topological ordering

Revisiting breadth-first search

Symmetry in DFS