Concepts2
⚙️AlgorithmIntermediate
Breadth-First Search (BFS)
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.
#bfs#breadth first search#graph traversal+12
⚙️AlgorithmIntermediate
Multi-Source BFS
Multi-source BFS explores an unweighted graph starting from several sources at once to compute the minimum distance to any source for every vertex.
#multi-source bfs#graph algorithms#shortest path+11