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 1585 / 1615 800
Shortest path 1416 / 1445 800
Finding the path 1299 / 1318 800
Path on binary matrix 1144 / 1173 800
Garden 1027 / 1056 800
Operations on number 1036 / 1081 900
Bipartite graph 896 / 934 900
Tom and Jerry 962 / 980 900
Festival 1 911 / 917 1000
Bamboo Forest of the Lost 672 / 965 1200
Radar 579 / 619 1200
Festival 2 543 / 575 1300
Go 425 / 442 1300
Escape from... dolls 435 / 459 1500
Long leg 372 / 425 1600
Lexicographically smallest path 307 / 354 1800
Graph coloring 246 / 305 1800