next up previous
Next: DFS Up: CSE 2320: Algorithms and Previous: Predecessor Subgraph

Depth-First Search



\psfig{figure=figures/f16-9.ps}



Vertex in DFF of T

pred
visited
discover
finish

Note again, Cormen et al. use color instead of visited.

Discover is the time when vertex first visited.

Finish is the time when all vertices reachable from this vertex have been visited.



Copyright © 1998 The University of Texas at Arlington