The PathBased Approach to DFS
The pathbased approach offers a
simple topdown development of the basic depthfirst search graph
algorithms.

"Pathbased depthfirst search for strong and biconnected components,"
Information Processing Letters 74, 2000, pp.107114.

"Searching",
book chapter
in
Handbook of Graph Theory, J.L. Gross and J. Yellen eds., pp.953984,
2003.

Class notes
for a unit on dfs 
topological sort, strong components, bridges & cutpoints,
Robbins' Theorem for strongly connected orientation,
carving algorithm for smallest bridgeless subgraph

Homework problems

Powerpoint slides
for the strong components
algorithm
(on opening, click "Cancel" on the menu about "links")
 C code for strong components algorithms (pathbased, LOWPOINT, and 2pass)
with graph generators and timers, by San Skulrattanakulchai.

list of the routines
 tarfile of the routines

Timing statistics
for the C code:
comparison of Path, LOWPOINT &
2pass algorithms for strong components

History of the pathbased algorithm
for strong components