Skip to main content

CS408: Advanced Artificial Intelligence

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS408: Advanced Artificial Intelligence /
  • Unit 2: Solving Problems by Searching /
  • 2.3: Common Search Techniques with Graphs
Back to 'Unit 2: Solving Problems by Searching'
  • 2.3: Common Search Techniques with Graphs

      • 2.3.1: Depth-first Search

        •  Wikipedia: "Depth-First Search" URL

          Read this article to learn how depth-first search works. Study the included example.

      • 2.3.2: Breadth-First Search

        •  Wikipedia: "Breadth-First Search" URL

          Read this article and make sure you know the differences between depth-first and breadth-first search algorithms.

      • 2.3.3: Dijkstra's Algorithm

        •  Wikipedia: "Dijkstra's Algorithm" URL

          Read this article to learn how Dijkstra's algorithm works. Work through the example in the article.

    Navigation

    Art History
    Biology
    Business Administration
    Chemistry
    Communication
    Economics
    English
    History
    Mathematics

    Creative Commons License
    © Saylor Academy 2010-2018 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See www.saylor.org/open/licensinginformation for detailed licensing information.

    Saylor Academy and Saylor.org® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

    Terms of Use | Privacy Policy