Abstract
For the list object, introduced in Chapter 5, it was shown that each data element contains at most one predecessor element and one successor element. Therefore, for any given data element or node in the list structure, we can talk in terms of a next element and a previous element.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Sengupta, S., Korobkin, C.P. (1994). Graphs and Digraphs. In: C++. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2636-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2636-9_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7618-0
Online ISBN: 978-1-4612-2636-9
eBook Packages: Springer Book Archive