|
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
There
are two basic graph-traversal
|
|
|
algorithms
that we will discuss.
|
|
|
| • |
These
algorithms visit the vertices in
|
|
|
different
orders,
|
|
|
|
– |
but
if they both start at the same vertex,
|
|
they
will visit the same set of vertices.
|
|
|
| • |
Depth
first search
|
|
|
| • |
Breadth
first search
|
|
|
|