Lecture4-Properties of DFS.pptVIP

Lectrue4-Properties of DFS Properties of DFS Classification of edges Topological sort Properties of DFS Definition: In a rooted forest (especially, depth-first forest), any vertex u on the simple path from the root to v is called an ancestor of v, and v is called a descendant of u. Note: u = ?[v] if and only if DFS-VISIT (v) was called during a search of u’s adjacency list. u is called the parent of v. So: Vertex v is a descendant of vertex u in the depth-first forest if and only if v is discovered during the time in which u is gray (when v is discovered, DFS-VISIT(?[v]) is called, DFS-VISIT(? ?[v]), …DFS-VISIT(u)) is called). Properties of DFS (Cont.) Parenthesis Theorem: In any DFS of a graph (directed or undirected), for each pair of vertices u, v, exactly one of the following conditions holds: u is a descendant of v, and [d[u], f[u]] is a subinterval of [d[v], f[v]]. u is an ancestor of v, and [d[v], f[v]] is a subinterval of [d[u], f[u]]. Neither u is a descendant of v nor v is a descendant of u, and [d[u], f[u]] and [d[v], f[v]] are disjoint. Page:166 Proof It is obvious that each pair u, v satisfies exactly one of the following: u is a descendant of v v is a descendant of u neither is descendant of the other It is enough to prove that 1 holds if and only if [d[u], f[u]] is a subinterval of [d[v], f[v]]; 2 holds if and only if [d[v], f[v]] is a subinterval of [d[u], f[u]]; 3 holds if and only if [d[u], f[u]] and [d[v], f[v]] are disjoint. Proof (Continued) If 1 holds, then u must be discovered when v is gray, that means d[v]?d[u]f[u] ? f[v]. In the opposite, if d[v] ? d[u]f[u] ? f[v], then u is discovered when v is gray, that is, u is a descendant of v. Then second case is similar to the above. If neither is descendant of the other. Without loss of generality, suppose d[u]d[v], then, since v is not a descendant of u, v must be discovered after u finishes, that is, f[u]d[v], hence, [d[u], f[u]] is disjoint with [d[v],f[v]]. In the opposite, if [d[u