Groups
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.
Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.