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

The following code snippet contains an implementation of a **Disjoint Set Union** data structure as it’s used in the [Implementation of Kruskal's algorithm](https://www.educative.io/courses/graph-algorithms-coding-interviews-c-plus-plus/kruskals-algorithm). 

Study the implementation of a DSU data structure.

Introduction

Graph Representations

Graph Traversal

Shortest Paths

Spanning Trees

Flow Problems

Conclusion

Appendix

Disjoint Set Union Data Structure