White Path Lemma

Learned in CS341.

White Path Lemma

When we start exploring a vertex $v$, any $w$ that can be connected to $v$ by an unvisited path will be visited during $explore(v)$.