Groups
Category
Breadth-First Search (BFS) explores a graph level by level, visiting all vertices at distance d from the source before any at distance d+1.
Multi-source BFS explores an unweighted graph starting from several sources at once to compute the minimum distance to any source for every vertex.