A cross-linked table storage form of a direction graph

Cross-linked list is another kind of chained storage structure of a direction graph. It can be regarded as a kind of linked list which combines the adjacency table of the direction graph with the inverse adjacency table (considering the degree only). In a cross list, there is a node for each vertex in the direction graph, and each arc has a nodal point.

Between vertices is an array of sequential storage, while arcs are chain-stored.

ARC node Structure:

Vertex node Structure:

Cross-linked form: