 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2017/functional-programming-design-and-analysis-of-algorithms-resit/7/c/ii/solution

False. The same ordered traversal gives a path

u \to x \to v

, but

d (v) = 4 > 3 = f (u) .

A path from

u

can pass through an already discovered ancestor, whose remaining edges are scanned only after

u

finishes. A reachability statement alone therefore does not impose the claimed finishing-time bound.

 New to topics? Read the docs here!