67
Exercise #10: Depth-first Traversal (iii)
Show how the stack evolves when executing
findPathDFS(g,0,5)
on:
Push neighbours in
descending
order … so they get popped in ascending order