Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

endVertices(e):
Return an array storing the end vertices of edge e.
areAdjacent(v,w):
Test whether vertices v and w are adjacent.
replace(v,x):
Replace the element stored at vertex v with x.
replace(e,x):
Replace the element stored at edge e with x.
insertVertex(x):
Insert and return a new vertex storing element x.
insertEdge(v, w,x):
Insert and return a new undirected edge with end vertices v and w and
storing element x.
removeVertex(v):
Remove vertex v and all its incident edges and return the element stored at
v.
removeEdge(e):
Remove edge e and return the element stored at e.
There are several ways to realize the graph ADT. We explore three such ways in the
next section.
13.2 Data Structures for Graphs
In this section, we discuss three popular ways of representing graphs, which are
usually referred to as the edge list structure, the adjacency list structure, and the
adjacency matrix. In all three representations, we use a collection to store the vertices
of the graph. Regarding the edges, there is a fundamental difference between the first
two structures and the latter. The edge list structure and the adjacency list structure
only store the edges actually present in the graph, while the adjacency matrix stores a
placeholder for every pair of vertices (whether there is an edge between them or not).
As we will explain in this section, this difference implies that, for a graph G with n
798