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 1573 / 1603 800
Shortest path 1403 / 1433 800
Finding the path 1288 / 1307 800
Path on binary matrix 1134 / 1164 800
Garden 1018 / 1047 800
Operations on number 1028 / 1073 900
Bipartite graph 888 / 927 900
Tom and Jerry 954 / 972 900
Festival 1 904 / 910 1000
Bamboo Forest of the Lost 665 / 958 1200
Radar 573 / 614 1200
Festival 2 537 / 570 1300
Go 420 / 438 1300
Escape from... dolls 433 / 457 1500
Long leg 371 / 424 1600
Lexicographically smallest path 307 / 353 1800
Graph coloring 245 / 304 1800