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 1889 / 1924 800
Shortest path 1691 / 1726 800
Finding the path 1549 / 1569 800
Path on binary matrix 1366 / 1397 800
Garden 1233 / 1260 800
Operations on number 1236 / 1283 900
Bipartite graph 1080 / 1117 900
Tom and Jerry 1144 / 1163 900
Festival 1 1082 / 1090 1000
Bamboo Forest of the Lost 799 / 1126 1200
Radar 688 / 731 1200
Festival 2 643 / 678 1300
Go 506 / 524 1300
Escape from... dolls 521 / 547 1500
Long leg 461 / 515 1600
Lexicographically smallest path 378 / 436 1800
Graph coloring 309 / 379 1800