Abstract
In the previous chapter, we looked at hashes, hashing, and hash tables. In this chapter, I will introduce an important mathematical concept that we will need to understand to comprehend the operation of later algorithms. That concept is graph theory. Graph theory can become involved and complex; however, for the sake of understanding, we will take the 20,000-foot view and avoid getting bogged down in the details. Graphs are essential to many parts of computer science, and once you understand how they work, you will be able to apply them to solve a wide array of problems. Mathematical gurus need not read this chapter, but for anyone else, it’s worthwhile to understand the basic concepts I present here.
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 subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Armstrong Subero
About this chapter
Cite this chapter
Subero, A. (2020). Graphs. In: Codeless Data Structures and Algorithms . Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-5725-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4842-5725-8_5
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-5724-1
Online ISBN: 978-1-4842-5725-8
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)