GitHub Repository Submission

When using GitHub mode, paste your repository URL below and click Save URL to store it. The saved URL will be automatically included with every message you send until you choose to clear it. Learn more

Your GitHub repository URL is saved. LSBot will automatically fetch your latest code from this repository for each message. To change the URL, clear it first and save a new one.

Exercise 1

DFS Recursive Solution

Try implementing the recursive solution on your own. Keep in mind that we first need to process the vertex before visiting other vertices. This should help you with the solution.

Again, it's important to note that multiple outputs are valid depth-first searches using preorder traversal. With our source node of 2, we can process our three outgoing neighbors in any order, so long as we explore that neighbor's entire depth before going to the next neighbor. The two most likely outcomes, based on our adjacency list, would be to process first 1 and its path, then 3 and its path, then 4 and its path, or, as we did in the walkthrough above, first 4, then 3, then 1.

Solution

function dfs(adjList, source) {
  console.log(source);
  let neighbors = adjList.get(source);
  for (let neighbor of neighbors) {
    dfs(adjList, neighbor);
  }
}

Hi! I'm LSBot. I can help you think through the selected exercise by giving you hints and guidance without revealing the solution. Your code from the editor will be automatically detected. Want to know more? Refer to the LSBot User Guide .

Detected solution
Loading...

Submit your solution for LSBot review.

Hi! I'm LSBot. Your code from the editor will be automatically detected. I'll review your solution and provide feedback to help you improve. Ask questions about your solution or request a comprehensive code review. Want to know more? Refer to the LSBot User Guide .

Detected solution
Loading...