 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
ADT
Graph operations might include:
|
|
|
– |
create
an empty graph
|
|
|
|
– |
determine
if the graph is empty
|
|
|
|
– |
insert
a vertex
|
|
|
|
– |
insert
an edge between two vertices
|
|
|
|
– |
delete
a vertex
|
|
|
|
– |
delete
an edge between two vertices
|
|
|
|
– |
retrieve
the value of the data at a vertex
|
|
|
|
– |
replace
the data at a particular vertex
|
|
|
|
– |
determine
if an edge is between vertices
|
|