FAQ: Graph Traversal: JavaScript - Depth-First Traversal (One path)

This community-built FAQ covers the “Depth-First Traversal (One path)” 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 Depth-First Traversal (One path)

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 #get-help.

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

Need broader help or resources? Head to #get-help and #community:tips-and-resources. If you are wanting feedback or inspiration for a project, check out #project.

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 #community:Codecademy-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!

Step 4 Part of this exercise is bothering me a little:
" If there was a cycle, or if the neighbor’s first connected vertex is the neighbor, we would be stuck in an infinite loop, iterating between the same neighbors. To account for this, we can add an array to keep track of all the vertices that we have visited. We should pass it in every recursive call, to make sure we never visit the same vertex more than once."

Sure that applies in directed acyclic graphs but there are graphs that are going to be undirected and we will by this virtue have to visit and edge or a vertex more than once. Should there be more comprehensive exercises in this section for both DAG and AG’s ??? If there is AG’s there should be other algos we’re learning here like how to implement Bellman Ford or what not.

It is explained in the description we are making a function for traversing through a directed graph. This is our first traversal, I think more comprehensive exercises will be after this.