 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
To
determine all vertices adjacent to a given
|
|
|
vertex, we only need to traverse the linked
|
|
|
list
associated with the specified vertex.
|
|
|
| • |
What
about traversing a graph?
|
|
|
|
– |
Graph-traversal
starts at a specified vertex and
|
|
|
does
not stop until it has visited all of the vertices
|
|
that
it can reach.
|
|
|
|
– |
It
visits all vertices that have a path between the
|
|
|
specified
vertex and the next.
|
|