breadth-first search
Breadth-first search (BFS) is a graph traversal algorithm used to explore or search a connected and undirected graph or tree. It starts at a given vertex or node and explores all its neighboring vertices before moving on to the next level of neighbors. This process is repeated layer-by-layer until all vertices have been visited, ensuring that all vertices at a given level are explored before moving deeper into the graph. BFS efficiently finds the shortest path between a starting vertex and any other vertex in an unweighted graph.
Requires login.
Related Concepts (1)
Similar Concepts
- binary search tree
- binary search trees
- binary tree traversal algorithms
- breadth-first search (bfs)
- depth-first search
- depth-first search (dfs)
- depth-limited search
- dijkstra's algorithm
- graph shortest path algorithms
- in-order traversal
- in-order traversal of binary trees
- iterative tree traversal
- path traversal
- tree recursion
- tree traversal