Graph Traversal: Depth-First Search

6 CQ

Learn how the DFS algorithm functions, when backtracking and restarting occurs, and the running time for DFS in both directed and undirected graphs.

  • Recommended Recommended
  • History & In Progress History
  • Browse Library
  • Most Popular Library

Get Personalized Recommendations

Let us help you figure out what to learn! By taking a short interview you’ll be able to specify your learning interests and goals, so we can recommend the perfect courses and lessons to try next.

Start Interview

    You don't have any lessons in your history.
    Just find something that looks interesting and start learning!

    1 Comments
    500 characters max

    Barbara H
    It would be nice to be able to pause for the questions. I found I needed more time to consider the available ansers in this unit, and needed to back up several times to answer the quizzes.
    appreciate appreciated
     –  reply
     –  delete
    500 characters max