| Graphs |
|
|
|
|
|
|
|
|
|
|
|
| • | Depth-First
Search |
|||||||||
| – | This
traversal algorithm does not completely |
|||||||||
| specify
the order in which you should visit the |
||||||||||
| vertices
adjacent to a particular vertex. |
||||||||||
| – | One
possibility is to visit the vertices in sorted |
|||||||||
| order. |
||||||||||
| – | This
only works - of course - when our nodes in |
|||||||||
| each
linked list of an adjacency list are in sorted |
||||||||||
| order. |
||||||||||