Generic Graph Algorithms

  • Dietmar Kühl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1766)


Implementing non-trivial algorithms, like many graph algorithms, is generally expensive. Thus, it is desirable to reuse such implementations whenever possible. The implementations of graph algorithms normally cannot be reused mainly because the representations of graphs differ in many ways and the implementations normally assume one specific representation. This article presents an approach to overcoming this problem which is based mainly on special iterators and special means to access data associated with objects.


graph algorithm iterator data accessor algorithm object 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Network Flows, Prentice Hall, 1993.Google Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.L., Rivest, R.L., Introduction to Algorithms, MIT Press, 1990.Google Scholar
  3. 3.
    Kühl, D., Weihe, K., “Data Access Templates,” C++-Report, 9, 1997, 18–21.Google Scholar
  4. 4.
    Lumsdaine, A., Lee, L.Q., Siek, J., The Generic Graph Components Library, 1999,
  5. 5.
    Mehlhorn, K., Näher, S., “LEDA: a library of efficient data structures and algorithms,” Communications of the ACM, 38, 96–102, 1995.CrossRefGoogle Scholar
  6. 6.
    Musser, D., Saini, A., The STL Tutorial and Reference Guide, Addison-Wesley, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Dietmar Kühl
    • 1
  1. 1.Claas Solutions GmbHGermany

Personalised recommendations