Skip to content

Files

Latest commit

fd89881 · Apr 25, 2018

History

History
This branch is 648 commits behind trekhleb/javascript-algorithms:master.

breadth-first-search

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Apr 25, 2018
Apr 25, 2018
Apr 25, 2018

Breadth-First Search (BFS)

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nodes first, before moving to the next level neighbors.

Algorithm Visualization

References