MPI-INF/SWS Research Reports 1991-2021

2. Number - only D1


Integration of graph iterators into LEDA

Nissen, Marco

October 1999, 39 pages.

Status: available - back from printing

This paper explains some implementation details of graph iterators and data accessors in LEDA. It shows how to create new iterators for new graph implementations such that old algorithms can be re--used with new graph implementations as long as they are based on graph iterators and data accessors.

  • Attachement: (193 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Nissen, Marco},
  TITLE = {Integration of graph iterators into LEDA},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-1999-1-006},
  MONTH = {October},
  YEAR = {1999},
  ISSN = {0946-011X},