Forward edge in depth-first search
= Forward edge in depth-first search
A <directed edge> to a proper descendant in the <depth-first search> forest that is not a tree <edge>. Its endpoints satisfy $d(u)<d(v)<f(v)<f(u)$.
= Forward edge in depth-first search
A <directed edge> to a proper descendant in the <depth-first search> forest that is not a tree <edge>. Its endpoints satisfy $d(u)<d(v)<f(v)<f(u)$.