JavaScript Algorithms and Data Structures: Graphs - Breadth-First Search

Breadth-first search (BFS) is an algorithm for traversing or searching a graph data structure. Learn how to implement BFS in JavaScript.

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.

References

• Wikipedia
• Tree Traversals (Inorder, Preorder and Postorder)
• BFS vs DFS
• BFS Visualization

The Original Article can be found on https://github.com

#javascript #algorithms #datastructures #graphs