Module BFS / DFS

BFS / DFS

Frequency: 10/10

One of the most important algorithms in graph theory.

Resources

- [Youtube Abdul Bari: 5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search](https://www.youtube.com/watch?v=pcKY4hjDrxk) - [Wikipedia: Depth-first search](https://en.wikipedia.org/wiki/Depth-first_search) - [Wikipedia: Breadth-first search](https://en.wikipedia.org/wiki/Breadth-first_search)

Problems

Connected component 1204 / 1229 800
Shortest path 1062 / 1088 800
Finding the path 975 / 990 800
Path on binary matrix 848 / 873 800
Garden 764 / 786 800
Operations on number 782 / 824 900
Bipartite graph 673 / 706 900
Tom and Jerry 715 / 730 900
Festival 1 680 / 686 1000
Bamboo Forest of the Lost 482 / 733 1200
Radar 437 / 469 1200
Festival 2 404 / 432 1300
Go 306 / 319 1300
Escape from... dolls 322 / 337 1500
Long leg 277 / 325 1600
Lexicographically smallest path 240 / 277 1800
Graph coloring 172 / 220 1800