Journal ArticleOPEN ACCESS

A versatile data structure for edge-oriented graph algorithms

Communications of the ACM (1987) 30(6) 513-519
DOI: 10.1145/214762.214769
29Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

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. © 1987, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Ebert, J. (1987). A versatile data structure for edge-oriented graph algorithms. Communications of the ACM, 30(6), 513–519. https://doi.org/10.1145/214762.214769

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free