| Graphs |
|
|
|
|
|
|
|
|
|
|
| • | Two
common operations are to find an edge |
||||||||
| between
two vertices and to find all vertices |
|||||||||
| adjacent
to a given vertex. |
|||||||||
| • | Using
an adjacency list to determine whether |
||||||||
| there
is an edge from one vertex to another, |
|||||||||
| we
must traverse the linked list associated |
|||||||||
| with
one of the vertices to determine whether |
|||||||||
| the
other vertex is present. |
|||||||||