III. GRAPH-THEORETIC DATA STRUCTURES
There are different ways to store graphs in a
computer system. The data structure used depends
on both the graph structure and the algorithm used
for manipulating the graph. Theoretically one can
distinguish between list and matrix structures but in
concrete applications the best structure is often a
combination of both. List structures are often
preferred for sparse graphs as they have smaller
memory requirements. Matrix structures on the
other hand provide faster access for some
applications but can consume huge amounts of
memory. [3].