Abstract
Graph structures are common. For example, if we represent each city with a circle and the roads connecting to them with a line, we get a graph. Generally, the traffic is bidirectional, so we get an undirected or bidirectional 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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Upadhyaya, B.P. (2019). Graphs. In: Data Structures and Algorithms with Scala. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-12561-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-12561-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12560-8
Online ISBN: 978-3-030-12561-5
eBook Packages: Computer ScienceComputer Science (R0)