17
Exercise #3: Depth-first Traversal (ii)
Show the DFS order in which we visit vertices in this graph when searching for a path from 0 to 6:
Consider neighbours in ascending order
![[Diagram:Pic/traversal.png]](Pic/traversal.png)
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}