A Versatile Data Structure for Edge-Oriented Graph Algorithms

@article{Ebert1987AVD,
  title={A Versatile Data Structure for Edge-Oriented Graph Algorithms},
  author={J{\"u}rgen Ebert},
  journal={Commun. ACM},
  year={1987},
  volume={30},
  pages={513-519}
}
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. 

Similar Papers

Loading similar papers…