12
Digraph Representation
Similar set of choices as for undirectional graphs:
array of edges
(directed)
vertex-indexed adjacency matrix
(non-symmetric)
vertex-indexed adjacency lists
V
vertices identified by
0 .. V-1