A versatile data structure for edge-oriented graph algorithms

1 June 1987

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 30 (6) , 513-519
https://doi.org/10.1145/214762.214769

Abstract

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.

Keywords

STRUCTURE
EDGE ORIENTED
TRAVERSALS
FORWARD
STORED
GREAT
ADJACENCY
BACKWARD

This publication has 1 reference indexed in Scilit:

GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969