Data Structures and Algorithms
with Object-Oriented Design Patterns in C++ 
Consider a directed graph 
.
Since 
,
graph G contains at most 
edges.
There are 
possible sets of edges
for a given set of vertices 
.
Therefore,
the main concern when designing a graph representation scheme
is to find a suitable way to represent the set of edges.
Copyright © 1997 by Bruno R. Preiss, P.Eng. All rights reserved.