Search Wiki

Bfs

Algorithm for graph traversal or search.

Breadth First Search

BFS stands for Breadth-First Search, an algorithm used in graph traversal or search that explores all neighbors at the present depth level before moving on to nodes at the next depth level.

Etymology

BFS is an abbreviation of Breadth-First Search.

Explain Like I’m 5

BFS is like exploring a maze by checking every room right next to the entrance before moving further away.

Fun Facts

BFS guarantees finding the shortest path in an unweighted graph
,It was developed by Edsger W
Dijkstra and Robert Endre Tarjan
,BFS uses a queue data structure to keep track of nodes to visit

FAQ

What is BFS? It's an algorithm for traversing or searching graphs
,How does it work? It explores nodes level by level, starting from a root node
,What is it used for? Finding the shortest path in an unweighted graph

Hypernyms — Broader Categories

graph traversal search algorithm

Indexes

algorithm computer science term search strategy

Related

Built by Tim Jones