Summary
A graph is a non-linear data structure, which is very important due to the large number of real-world applications it has. In this chapter, we have discussed different ways to represent a graph in Python, using lists and dictionaries. Further, we learned two very important graph traversal algorithms, i.e., depth-first search (DFS) and breadth-first search (BFS). Moreover, we also discussed two very important algorithms for finding an MST, i.e. Kruskal’s algorithm and Prim’s algorithm.
In the next chapter, we will discuss searching algorithms and the various methods using which we can efficiently search for items in lists.
