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
Depth-First Search (DFS)
Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.
#depth-first search#dfs#graph traversal+12