Generic Data Structures and Algorithms in Go: An Applied Approach Using Concurrency, Genericity and Heuristics

© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2022

R. WienerGeneric Data Structures and Algorithms in Gohttps://doi.org/10.1007/978-1-4842-8191-8_16

16. Graph Structures

Richard Wiener¹  

(1)

Colorado Springs, CO, USA

 

In the previous chapter, we presented dynamic programming and three applications.

In this chapter, we introduce graph structures and some applications. We show several examples of how to represent a graph, and we examine some basic algorithms associated with graph traversal.

In the next section, we examine how graphs can be represented.

16.1 Representing Graphs

Graph data structures provide one of the most useful and powerful frameworks for algorithm design. A graph (not to be confused with a pictorial ...