breadth-first search (BFS)
RU: поиск в ширину (BFS)
A graph traversal that visits all vertices at distance d from the source before any at distance d+1, using a queue. It runs in O(V + E) and finds shortest paths in unweighted graphs.
RU: поиск в ширину (BFS)
A graph traversal that visits all vertices at distance d from the source before any at distance d+1, using a queue. It runs in O(V + E) and finds shortest paths in unweighted graphs.