На повторение: [Поиск в ширину](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1?page=1&category=DFS,BFS&sortBy=submissions) и [Поиск в глубину](https://practice.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1?page=1&category=DFS,BFS&sortBy=submissions).
