FAQ: Graph Traversal: JavaScript - Breadth-First Traversal (All layers)

This community-built FAQ covers the “Breadth-First Traversal (All layers)” exercise from the lesson “Graph Traversal: JavaScript”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Pass the Technical Interview with JavaScript

FAQs on the exercise Breadth-First Traversal (All layers)

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!
You can also find further discussion and get answers to your questions over in Language Help.

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head to Language Help and Tips and Resources. If you are wanting feedback or inspiration for a project, check out Projects.

Looking for motivation to keep learning? Join our wider discussions in Community

Learn more about how to use this guide.

Found a bug? Report it online, or post in Bug Reporting

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

The Bonus Questions at the end of this section state how would you use recursion in a BFS implementation. My understanding considering recursion could increase the complexity of the whole algorithm. Wouldn’t it go from 0 (V+E) to 0(N*N)? … Recursion would be an iterator as opposed to recursion in the classic sense of the word? Possible also you’d be risking a higher probability of stack overflow on a more complex graph. So I’m bepuzzled. I think if you did you’d have some sort of hybrid of DFS/BFS which I’m sure more fancy algos. do.

Though is it more of a question of optimizing BFS? Cause that’s always a good thing.
What about :

  • Using an adjacency list to reduce memory usage.

  • Using an array for visited nodes to prevent visiting the same nodes repeatedly.

I’m sure there are better optimizations from more skilled programming brains but that’s all I could think of.

1 Like