CMPSCI 311: Theory of Algorithms

David Mix Barrington

Fall, 2003

Discussion Notes #5

from Wednesday 8 Oct 2003

Fun With Depth-First Search

Please answer the questions during the discussion period.

Here are two graphs in adjacency list format. G is undirected and H is directed:

Last modified 9 October 2003