The graph iterators are a part of the LEDA software library.

The support for this package has been completely transferred to the Algorithmic Solutions software company.

The authors of graph iterators are Prof. Karsten Weihe (karsten.weihe"at"uni-konstanz.de) and Dipl-Inform. Marco Nissen (marco"at"nordfriese.com).

• M.Nissen: Graph Iterators: Decoupling Graph Structures from Algorithms (ps.gz ; html)
• Dietmar Kuehl, M.Nissen, Karsten Weihe: Efficient, adaptable implementations of graph algorithms (Proceeding). Further Information: here
• D. Kühl, K.Weihe: Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms (Working Paper). Further information: here
• D. Kühl, K.Weihe: Data Access Templates. Further information: here
• D. Kühl, K.Weihe: Iterators and Handles for Nodes and Edges in Graphs. Further information: here
• M. Nissen, K.Weihe: Combining LEDA with Customizable Implementations of Graph Algorithms. Further information: here
• K.Weihe: Reuse of Algorithms: Still a Challenge to Object-Oriented Programming. Further information: here
• Dieter Gluche, Dietmar Kühl, K.Weihe: Iterators Evaluate Table Queries. Further information: here
• Marco Nissen, Karsten Weihe: Attribute classes in Java and language extensions. Further information: here