Data Structures and Algorithms
with Object-Oriented Design Patterns in Java 
In order to make the appropriate choice when selecting a graph representation scheme, it is necessary to understand the time/space trade-offs. Although the details of the implementations have been omitted, we can still make meaningful conclusions about the performance that we can expect from those implementations. In this section we consider the space required as well as the running times for basic graph operations.
Copyright © 1998 by Bruno R. Preiss, P.Eng. All rights reserved.