A Practical Guide to Data Structures and Algorithms using Java

906 A Practical Guide to Data Structures and Algorithms Using Java

55.3 Methods

We now describe the AdjacencyListRepresentation methods for adding, removing, and accessing

the vertices and edges of the graph.

55.3.1 Constructors

The constructor takes isDirected, which is true when the graph is a directed graph, and storeIn-

comingEdges, which is true when the incoming edges should be maintained. Observe that no

parameter is needed to indicate whether the graph allows multi-edges, since the underlying rep-

resentation of an adjacency list is not affected by this choice. The differences in the implementation

for a graph and a multigraph are handled by ...