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++

You want to solve the ASSP problem in a dense weighted graph. Which algorithm has a better worst-case runtime?

You want to solve the ASSP problem in a dense weighted graph. Which algorithm has a better worst-case runtime?

Graphs with negative edges, but no negative cycles

In which kinds of graphs does Floyd-Warshall correctly compute shortest paths? Select all that apply.

In which kinds of graphs does Floyd-Warshall correctly compute shortest paths? Select all that apply.

In which kinds of graphs does Dijkstra correctly compute shortest paths? Select all that apply.

In which kinds of graphs does Dijkstra correctly compute shortest paths? Select all that apply.

Quiz: Shortest path algorithms

Quiz: Shortest path algorithms

Quiz yourself on shortest path algorithms.

Introduction

Graph Representations

Graph Traversal

Shortest Paths

Spanning Trees

Flow Problems

Conclusion

Appendix

Quiz: Shortest Paths