UNPKG

@dxzmpk/js-algorithms-data-structures

Version:

Algorithms and data-structures implemented on JavaScript

github.com/dxzmpk/javascript-algorithms

dxzmpk/javascript-algorithms

17 lines (12 loc) • 800 B
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
# 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](https://upload.wikimedia.org/wikipedia/commons/5/5d/Breadth-First-Search-Algorithm.gif) ## References - [Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search) - [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/) - [BFS vs DFS](https://www.geeksforgeeks.org/bfs-vs-dfs-binary-tree/) - [BFS Visualization](https://www.cs.usfca.edu/~galles/visualization/BFS.html)