Learn Graph Algorithms in C++

Recap and Next Steps

Look back at what you learned. Get inspired by checking out further graph algorithm topics.

We'll cover the following...

Recap
Next steps

Eulerian trails
General matchings
Traveling salesmen
Further NP-hard graph problems

Recap

Congratulations on finishing this course on graph algorithms in C++! Let’s recap what we learned in each chapter.

First, we discovered the fundamental concepts and terminology of graph theory, such as directed, undirected, and weighted graphs.
Next, we explored how graphs can be represented as data structures in programs, using adjacency lists and adjacency matrices.
We traversed graphs using BFS and DFS and studied applications of graph traversal, such as computing strongly connected components.
We also computed shortest paths in weighted graphs using Dijkstra’s algorithm and the Floyd-Warshall

...