Summary
In this chapter, we covered the basic concepts of graphs. We learned the different ways we can represent this data structure, and we created a class to represent a graph using an adjacency list. We also learned how to traverse a graph using BFS and DFS approaches. This chapter also covered two applications of BFS and DFS, which find the shortest path using BFS and topological sorting using DFS.
This chapter also covered some famous algorithms, such as Dijkstra's algorithm and the Floyd-Warshall algorithm, to calculate the shortest path. We also covered Prim's algorithm and Kruskal's algorithm to calculate the minimum spanning tree of a graph.
In the next chapter, you will learn about the most common sorting algorithms used in computer science.
