trjhtr

Given a graph and a starting vertex print the value of each vertex in a depth-first order.

I include the code for DFS iteratively by solving the starter problem of traversing and printing values below.

Pseudocode - While Loop and Stack
1. Create a stack to hold neighbor vertices and add the start vertex.
2. Create a set to track visited vertices and add the start vertex.
3. While stack is not empty
 4. Dequeue from the queue and set to current.
 5. Operate on current
 6. Loop through all the vertex's neighbors.
 7. For each neighbor, check if the vertex has been visited.
 8. If not visited, then add it to the queue and add mark it as visited.
9. Once the stack is empty, we have completed the DFS

I look up some article and medium Resource can be found here:

Here's the code in JavaScript:

function graphDFS(graph, start) 
 let stack = new Stack();
 let visited = new Set();
 let current;
 let neighbors;

 stack.push(start);
 visited.add(start);

 while (stack.length > 0) 
 current = stack.pop();
 console.log(current);
 neighbors = graph.neighbors(current);
 for (let neighbor of neighbors) 
 if (!visited.has(neighbor)) 
 stack.push(neighbor);
 visited.add(neighbor);