Abstract
Like sets, graphs are important mathematical entities. In mathematical texts graphs are typically placed in the category of algebraic structures. Arbitrary relationships between data items can often be represented naturally using directed and undirected graphs. Directed graphs can be used as a useful way of describing binary relations. Tree data structures are a special form of directed graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA 1983.
G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.
N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, NJ 1974.
F. Harary, Graph Theory, Addison-Wesley, Reading, MA 1972.
E. Horowitz and S. Sahni, Fundamentals of Data Structures, Computer Science Press, Potomac, MD 1976.
E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Reinhart and Winston, New York, NY 1976.
G.P. McKeown and V.J. Rayward-Smith, Mathematics for Computing, John Wiley & Sons, New York, NY 1982.
K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP- Completeness, Springer-Verlag, Berlin Heidelberg 1984.
J.L. Mott, A. Kandel, and T.P. Baker, Discrete Mathematics for Computer Scientists, Reston Publishing Company, Reston, VA 1983.
C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ 1982.
R. Sedgewick, Algorithms, Addison-Wesley, Reading, MA 1983.
R. Skvarcius and W. B. Robinson, Discrete Mathematics with Computer Science Applications, Benjamin/Cummings, Menlo Park, CA 1986.
A.M. Tenenbaum and M.J. Augenstein, Data Structures Using Pascal, Prentice- Hall, Englewood Cliffs, NJ 1981.
A. Tucker, Applied Combinatorics, John Wiley & Sons, New York, NY 1980.
J.D. Wiest and F.K. Levy, A Management Guide to PERT/CPM: with GERT/PDM/DCPM and other Networks, 2nd ed., Prentice-Hall, Englewood Cliffs, NJ 1977.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Lins, C. (1989). The Graph Abstraction. In: The Modula-2 Software Component Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6386-6_10
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6386-6_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-6388-0
Online ISBN: 978-1-4684-6386-6
eBook Packages: Springer Book Archive