BFS / DFS
Frequency: 10/10
One of the most important algorithms in graph theory.Resources
Problems
| Connected component | 1137 / 1161 | 800 | |
| Shortest path | 994 / 1018 | 800 | |
| Finding the path | 915 / 930 | 800 | |
| Path on binary matrix | 801 / 824 | 800 | |
| Garden | 721 / 742 | 800 | |
| Operations on number | 733 / 776 | 900 | |
| Bipartite graph | 634 / 664 | 900 | |
| Tom and Jerry | 678 / 693 | 900 | |
| Festival 1 | 646 / 652 | 1000 | |
| Bamboo Forest of the Lost | 448 / 692 | 1200 | |
| Radar | 415 / 446 | 1200 | |
| Festival 2 | 385 / 412 | 1300 | |
| Go | 293 / 306 | 1300 | |
| Escape from... dolls | 307 / 321 | 1500 | |
| Long leg | 261 / 308 | 1600 | |
| Lexicographically smallest path | 228 / 263 | 1800 | |
| Graph coloring | 159 / 206 | 1800 |