07. Graphs

This is the seventh short course – Graphs – of the Master Series on the Analysis of Algorithms. In this course, you’ll dive into the foundational and advanced aspects of graph theory. Learn about graph structures, Depth-First Search (DFS), and Breadth-First Search (BFS) algorithms, and explore their real-world applications like shortest path searching, finding strongly connected components, and working with heaps. The course also covers critical graph algorithms like Dijkstra, Bellman-Ford, and Minimum Spanning Trees, providing a deep understanding of graph-based problem-solving.