Graphs 2
Incidence and Adjacency
Representing a Digraph with an Adjacency Matrix
Adjacency Lists
Incidence Matrix
Using a Hash Table
Graph Search
Possible Solutions
Some Additional Solutions
Avoiding Loops
Depth-First Search
Breadth-First Search
Comparison of DFS and B(readth)FS
Vertex Visitation Order
Email: tanimoto@cs.washington.edu
Home Page: www.cs.washington.edu/people/faculty/tanimoto.html
Download presentation source