An abstract graph module that allows for easy and secure programming of a great number of graph algorithms is implemented by symmetrically stored forward and backward adjacency lists, thus supporting edge-oriented traversals of general directed and undirected graphs.
No takes yet. Share an insight, caveat, or question.
Jürgen Ebert (1987) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: