Explore the basics of graph theory, learn to represent graphs in C++, and master essential algorithms like DFS and Dijkstra to solve complex optimization problems, including matching and network flow.

Graph algorithms are the core of many real-world applications of computer science,  such as automotive navigation or routing in computer networks. They’re also a common subject in coding interviews at top-tier tech companies.
 
In this course, we’ll learn about the basic concepts of graph theory and how to represent graphs as data structures in code. We’ll study essential graph algorithms such as depth-first search or Dijkstra's algorithm to traverse graphs and find shortest paths. Finally, we’ll learn to solve more complex optimization problems on graphs, such as matching and network flow problems.

Learn Graph Algorithms in C++

Which kind of edge can be used to detect cycles using DFS?

Which kind of edge can be used to detect cycles using DFS?

Which data structure is used to store the nodes that still need to be explored in BFS?

Which data structure is used to store the nodes that still need to be explored in BFS?

Which graph traversal algorithm has a better worst-case runtime?

Which graph traversal algorithm has a better worst-case runtime?

Quiz: Graph traversal

Quiz: Graph traversal

Quiz yourself on graph traversal algorithms.

Introduction

Graph Representations

Graph Traversal

Shortest Paths

Spanning Trees

Flow Problems

Conclusion

Appendix

Quiz: Graph Traversal