Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Network Flows, Prentice Hall, 1993.
Cormen, T.H., Leiserson, C.L., Rivest, R.L., Introduction to Algorithms, MIT Press, 1990.
Kühl, D., Weihe, K., “Data Access Templates,” C++-Report, 9, 1997, 18–21.
Lumsdaine, A., Lee, L.Q., Siek, J., The Generic Graph Components Library, 1999, http://lsc.nd.edu/research/ggcl/
Mehlhorn, K., Näher, S., “LEDA: a library of efficient data structures and algorithms,” Communications of the ACM, 38, 96–102, 1995.
Musser, D., Saini, A., The STL Tutorial and Reference Guide, Addison-Wesley, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kühl, D. (2000). Generic Graph Algorithms. In: Jazayeri, M., Loos, R.G.K., Musser, D.R. (eds) Generic Programming. Lecture Notes in Computer Science, vol 1766. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39953-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-39953-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41090-4
Online ISBN: 978-3-540-39953-7
eBook Packages: Springer Book Archive