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 1057 / 1078 800
Shortest path 921 / 942 800
Finding the path 850 / 861 800
Path on binary matrix 744 / 766 800
Garden 661 / 681 800
Operations on number 675 / 717 900
Bipartite graph 578 / 605 900
Tom and Jerry 618 / 631 900
Festival 1 585 / 592 1000
Bamboo Forest of the Lost 406 / 645 1200
Radar 378 / 407 1200
Festival 2 349 / 377 1300
Go 263 / 278 1300
Escape from... dolls 279 / 292 1500
Long leg 235 / 282 1600
Lexicographically smallest path 210 / 244 1800
Graph coloring 144 / 192 1800