308-203A Introduction to Computing II Lecture 15: Searching Graphs II

11/16/00


Click here to start


Table of Contents

308-203A Introduction to Computing II Lecture 15: Searching Graphs II

Depth-First Search

Running Time of DFS

Running Time of DFS

Deficiencies of DFS

Breadth-First Search (BFS)

Breadth-First Search

Breadth-First Search

BFS - Example

BFS - Example

BFS - Example

BFS - Example

BFS - Example

BFS - Example

BFS - Example

BFS and trees

Comparison to DFS

Running time of BFS?

Any questions?

Author: Alfred Holz

Email: wrenne@acm.org

Home Page: http://www.cs.mcgill.ca/~cs203