Know the basics of C++ and want to further sharpen your skills? Then follow along with C++ expert Advait Jayant in his next course in the C++ Algorithm Series, and master advanced techniques with graphs. 

If you need to first develop a fundamental knowledge of C++, watch this excellent video on C++. Also here are all of Advait Jayant’s highly-rated videos on O’Reilly, including the full C++ Algorithm Series.

The following five topics will be covered through a combination of lecture and hands-on to further your knowledge of graphs in C++:

Djikstra’s Algorithm. This first topic in this Advanced Graphs course covers Djikstra’s Algorithm, also known as the Single Source Shortest Path Algorithm. Follow along with Advait in this hands-on session, and learn how to find the shortest path (minimum distance) in a weighted graph.

Traveling Salesman Problem. This second topic in this Advanced Graphs course explains how to solve the Traveling Salesman Problem in C++ using graphs. Learn about Hamiltonian cycles and the dynamic programming paradigm. Follow along with Advait in this hands-on session.

Holiday Accommodation Problem. This third topic in this Advanced Graphs course explains how to solve the Holiday Accommodation Problem in C++ using the pigeonhole principle and graphs. Follow along with Advait in this hands-on session.

Introducing Network Flow. This fourth topic in this Advanced Graphs course explains the principles of network flow in C++ using graphs. Important network flow concepts of flow, capacity, and augmented path are discussed. Follow along with Advait in this hands-on session.

Ford Fulkerson Algorithm. This fifth topic in this Advanced Graphs course explains how to perform the Ford Fulkerson Algorithm in C++ using graphs. Follow along with Advait in this hands-on session and find the maximum flow for a network flow graph.

HOMEPAGE

https://www.oreilly.com/library/view/c-algorithm-series/9781634626316/