Abstract
This chapter introduces graphs as diagrams for solving puzzles. Careful definitions specify the language of graph theory: vertices, edges, degrees, paths, circuits, Euler paths, Hamilton paths, and so on. Then our interest returns to trees, with algorithms for depth-first traversal and for breadth-first traversal.
Algorithms for constructing a minimum connector and finding shortest paths joining two specified vertices are given for edge-weighted graphs. Finally, for directed graphs, we give Dijkstra’s Algorithm for shortest dipaths and the Floyd-Warshall Algorithm for the distance matrix.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Jenkyns, T., Stephenson, B. (2018). Graphs and Trees. In: Fundamentals of Discrete Math for Computer Science. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70151-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-70151-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70150-9
Online ISBN: 978-3-319-70151-6
eBook Packages: Computer ScienceComputer Science (R0)