next up previous
Next: Depth-First Search Up: CSE 2320: Algorithms and Previous: Properties

Predecessor Subgraph

\(G_{pred} \;=\; (V_{pred}, \;E_{pred})\) is a predecessor subgraph of G if
Vpred = {v $\in$ V $\mid$ pred(v) $\neq$ NIL} $\cup$ {s}
Epred = {(pred(v), v) $\in$ E $\mid$ v $\in$Vpred - {s}}

Lemma 23.5 The pred tree generated by BFS results in a predecessor subgraph Gpred which defines a BF tree.

Copyright © 1998 The University of Texas at Arlington