55
Finding a Path
(cont)
Comparison of BFS/DFS search for checking if there is a path from
a
to
h
…
Both approaches ignore some edges by remembering previously visited vertices.
![[prev]](icon/prev.gif){kind=icon}
55
![[next]](icon/next.gif){kind=icon}
![[Diagram:Pic/graph-search-bfs-dfs.png]](Pic/graph-search-bfs-dfs.png)