Graph Searching
Goal: want to traverse the edges of the graph and visit each vertex reachable from the starting vertex.
Two important traversals
breadth-first search
depth-first search
Can you determine if there is a path from v to w in linear time?
Previous slide
Next slide
Back to first slide
View graphic version