Abstract
In chapter 3 we introduced linear data types as a collection of objects where each object, in general, could have one ‘next’ object and one ‘previous’ object. Trees were non-linear data types where the above restriction was relaxed and each object could have more than one ‘next’ object (children of a node) but, at most, only one ‘previous’ object (parent of a node). We can further generalise tree structures by allowing an object to have more than one ‘previous’ object. A graph is such an unconstrained structure where each object may have zero, one or many ‘next’ and ‘previous’ objects. This generality obviously adds an extra degree of freedom in structuring data to relate to the structure of real-world situations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes and Further Reading
Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1983). Data Structures and Algorithms, Addison-Wesley, Reading, Massachusetts.
Backhouse, R. (1979). Syntax of Programming Languages: Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey.
Backhouse, R. (1982). ‘An analysis of choice in program design’, in Biermann and Guiko (eds), Proceedings of Nato Summer School on Automatic Program Construction, Reidel, Dordrecht.
Dijkstra, E. W. (1959). ‘A note on two problems in connection with graphs’, Numerische Mathematik, Vol. 1, pp. 269–271.
Ebert, J. (1987). ‘A versatile data structure for edge-oriented graph algorithms’, CACM, Vol. 30, No. 6, pp. 513–519.
Floyd, R. W. (1962). ‘Algorithm 97: shortest path’, CACM, Vol. 5, No. 6, p. 345.
Hopcroft, J. E. and Ullman, J. D. (1983). ‘Set merging algorithms’, SLAM Journal of Computing, Vol. 2, No. 4, pp. 294–303.
Kruskal, J. B. (1956). ‘On the shortest spanning subtree of a graph and the travelling salesman problem’, Proceedings of American Mathematical Society, Vol. 7, No. 1, pp. 48–50.
Prim, R. C. (1957). ‘Shortest connection networks and some generalizations’, Bell System Technical journal, Vol. 36, pp. 1389–1401.
Yao, A. C. (1975). ‘An O(∣ E ∣ log log ∣ V ∣) algorithm for finding minimum spanning trees’, Information Processing Letters, Vol. 4, No. 1, pp. 21–23.
Author information
Authors and Affiliations
Copyright information
© 1990 Manoochehr Azmoodeh
About this chapter
Cite this chapter
Azmoodeh, M. (1990). Non-linear ADTs—Graphs. In: Abstract Data Types and Algorithms. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-21151-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-349-21151-7_7
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-51210-4
Online ISBN: 978-1-349-21151-7
eBook Packages: Computer ScienceComputer Science (R0)