Definition, Meaning & Synonyms
bfs
Noun
/biː ɛf ɛs/
Definition
BFS stands for Breadth-First Search, which is an algorithm used for traversing or searching tree or graph data structures.
Examples
- The BFS algorithm is often used for finding the shortest path in an unweighted graph.
- To implement BFS, you typically use a queue data structure to keep track of nodes that need to be explored.
Meaning
In BFS, the search explores all the neighbor nodes at the present depth prior to moving on to nodes at the next depth level.
Synonyms
- Level-order Traversal
- Graph Traversal
