406 B
406 B
Breadth-first search (BFS)
In the notes on depth-first search, we mention that the difference between DFS and BFS is the order in which nodes are traversed.
Using the same example, what would a breadth-first traversal look like if we start at vertex 0 in this graph?
0 --- 1
| |
3 --- 2
Can we also formalize an algorithm for breadth-first search?