Summary

This chapter was related to one of the most important data structures available while developing applications: graphs. As you learned, a graph is a data structure that consists of nodes and edges. Each edge connects two nodes. What’s more, there are various variants of edges, such as undirected and directed, as well as unweighted and weighted. All of them were described and explained in detail, and illustrations and code examples were provided. Two methods of graph representation, namely using an adjacency list and an adjacency matrix, were explained as well. You also learned how to implement a graph in the C# language.

While talking about graphs, it’s important to present some real-world applications, especially due to the common use of such a data structure. For example, this chapter explained the structure of friends that are available on social media or the problem of searching for the shortest path in a city.

Among the topics that were covered in this...