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