ausblenden:
Schlagwörter:
-
Zusammenfassung:
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.