archive-gh-me/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-12-08 19:06:00 +00:00
Code Issues Projects Releases Wiki Activity
javascript-algorithms/src/algorithms/tree/breadth-first-search
History
Oleksii Trekhleb fd898812f3 Add BFS and DFS for tree.
2018-04-25 17:41:21 +03:00
..
__test__
Add BFS and DFS for tree.
2018-04-25 17:35:44 +03:00
breadthFirstSearch.js
Add BFS and DFS for tree.
2018-04-25 17:35:44 +03:00
README.md
Add BFS and DFS for tree.
2018-04-25 17:41:21 +03:00

README.md

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