MPI-I-1999-1-006. October 1999, 39 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|