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.1: Graphs
Back to 'Unit 2: Solving Problems by Searching'
  • 2.1: Graphs

      • 2.1.1: Graph Definition

        •  Cameron McLeman's "Graph" URL

          Study the definition of a graph from this section and draw some examples of your own.

      • 2.1.2: Binary Tree

        •  Thomas Niemann's "Binary Tree" URL

          Make sure you know how a binary tree differs from a regular tree after the reading this section.

      • 2.1.3: Example Problem: Minimum Spanning Tree

        •  Cameron McLeman's "Minimum Spanning Tree" URL

          Read about minimum spanning trees and try to figure out how Prim's algorithm works; the solution can be found here. Before you check the solution, try to solve problem yourself. After you have solved the problem (or if you have spent a couple of hours working on it, and are stumped!), study the solution. 

    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