next up previous
Next: Up: Previous:

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 22.6 The pred tree generated by BFS results in a predecessor subgraph Gpred which defines a BF tree.


next up previous
Next: Up: Previous: