Traversal algorithms are algorithms to traverse or visit nodes in a graph. In this video, I will be showing how to implement breadth-first search traversal algorithm in JavaScript.

The algorithm starts at one node, first visits all its neighbors that are one edge away, then goes on to visiting each of their neighbors. The point is to determine how close nodes are to a root node.


💻 Code: [ Ссылка ]

🐦 Beau Carnes on Twitter: [ Ссылка ]

⭐JavaScript Tutorials Playlists⭐
▶JavaScript Basics: [ Ссылка ]
▶Data Structures and Algorithms: [ Ссылка ]
▶Design Patterns: [ Ссылка ]
▶ES6: [ Ссылка ]
▶Clean Code: [ Ссылка ]

-
Learn to code for free and get a developer job: [ Ссылка ]

Read hundreds of articles on technology: [ Ссылка ]

And subscribe for new programming videos every day: [ Ссылка ]

свернуть