GitHub/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-04-06 22:31:08 +08:00
Code Issues Projects Releases Wiki Activity
javascript-algorithms/src/algorithms/graph/breadth-first-search
History
j0pgrm 2a6f724589
Malay readme (#927) 
* update-readme

* deploy

* deploy

Co-authored-by: name <your mail>
Co-authored-by: Oleksii Trekhleb <trehleb@gmail.com>
2022-12-05 07:59:33 +01:00
..
__test__
Add detect cycle.
2018-05-05 10:58:04 +03:00
breadthFirstSearch.js
Add detect cycle.
2018-05-05 10:58:04 +03:00
README.md
Malay readme (#927)
2022-12-05 07:59:33 +01:00

README.md

Breadth-First Search (BFS)

Breadth-first search (BFS) is an algorithm for traversing, 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