[prev] 68 [next]

Exercise #10: Depth-first Traversal (i)

Trace the execution of dfsPathCheck(G,0,5) on:

[Diagram:Pic/graph3.png]

Consider neighbours in ascending order