Intro to Computation & AI

Table of Contents

Intro to Computation & AI

Graph Basics

Examples

Graph Formalism

Paths, Adjacency, Cycles

Connectivity

Connectivity Examples

Adjacency Sets and Degrees

Degrees for Directed Graphs

Graph Representations: The Adjacency Matrix

Graph Representations: Edge lists

Graph Insertion

Complexity of Simple Graph Insertion

Example

Graph Search

Recursive DFS

Example

Example

Example

Example

Example

Example

Example

Shortest Path

PERT/CPM

The Travelling Salesman Problem (TSP)

The Class P

The Class NP

Instant Ph.D.

NP-Completeness

Proving a Problem is in NP

Step 1: Show TSP is in NP

Step 2: Reduce Hamiltonian Circuit to TSP

Step 3: Proof by Contradiction

Who Cares?

What do you do with an NP-complete problem?

Email: jeffreys+@andrew.cmu.edu

Other information:
Author: Jill Fain Lehman