HomeCoursesLearn Graph Algorithms in C++

Updated 27 Aug

AI-powered learning

Save

Learn Graph Algorithms in C++

Name: Learn Graph Algorithms in C++
Price: 59 USD
Author: Lukas Huwald

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.

4.8

42 lessons

Created by Lukas Huwald

What's included

42 lessons across 8 modules
11 quizzes with instant feedback
AI Tutor on every lesson

Join 3.1 million developers at

What You'll Learn

Learn how graphs can be represented as data structures
Traverse graphs using search algorithms
Find the shortest paths in graphs
Find maximum matchings
Solve flow problems
Compute minimum spanning trees

Learning Roadmap

42 Lessons11 Quizzes5 Challenges

Introduction

Get familiar with fundamental graph concepts, key terminology, and algorithm efficiency analysis.

Introduction to Graph Algorithms

Directed and Undirected Graphs

Graph Terminology I

Graph Terminology II

Weighted Graphs

Excursion: Algorithm Analysis

Quiz: Introduction to Graph Algorithms

Graph Representations

Discover the logic behind graph representations, including adjacency matrices, adjacency lists, and their comparisons.

Adjacency Matrix

Adjacency List

Representing Weighted Graphs

Comparison of Graph Representations

Quiz: Graph Representations

Challenge: Converting Graph Representations

Graph Traversal

9 Lessons

Work your way through DFS and BFS implementations, topological sort, SCCs, and bipartite graphs.

Shortest Paths

7 Lessons

Break down complex ideas on shortest path algorithms and their implementation techniques.

Spanning Trees

5 Lessons

Deepen your knowledge of minimum spanning trees, Kruskal's algorithm, and maximum spanning tree challenges.

Flow Problems

6 Lessons

Focus on solving max flow problems, Ford-Fulkerson method, and bipartite matching challenges.

Conclusion

Master the steps to understanding graph algorithms, solving fundamental problems, and exploring advanced topics.

Recap and Next Steps

Appendix

Step through the Disjoint Set Union structure and its optimizations for dynamic connectivity.

Disjoint Set Union Data Structure

Certificate of Completion

Showcase your accomplishment by sharing your certificate of completion.

About this course

WHY I WROTE THIS COURSE

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.

ABOUT THE AUTHOR

Lukas Huwald

Machine learning engineer & functional programming enthusiast.

Learn more about Lukas

Trusted by 3.1 million developers working at companies

These are high-quality courses. Trust me the price is worth it for the content quality. Educative came at the right time in my career. I'm understanding topics better than with any book or online video tutorial I've done. Truly made for developers. Thanks

Anthony Walker

@_webarchitect_

Just finished my first full #ML course: Machine learning for Software Engineers from Educative, Inc. ... Highly recommend!

Evan Dunbar

ML Engineer

You guys are the gold standard of crash-courses... Narrow enough that it doesn't need years of study or a full blown book to get the gist, but broad enough that an afternoon of Googling doesn't cut it.

Software Developer

Carlos Matias La Borde

I spend my days and nights on Educative. It is indispensable. It is such a unique and reader-friendly site

Souvik Kundu

Front-end Developer

Your courses are simply awesome, the depth they go into and the breadth of coverage is so good that I don't have to refer to 10 different websites looking for interview topics and content.

Vinay Krishnaiah

Software Developer