57
Exercise 13: Depth-first Traversal
Show the DFS order we visit to determine isPath(a,k)
Assume neighbours are chosen in alphabetical order
![[prev]](icon/prev.gif){kind=icon}
57
![[next]](icon/next.gif){kind=icon}
![[Diagram:Pics/graphs/isPath-traversal.png]](Pics/graphs/isPath-traversal.png)