C++ Algorithm Series Advanced Graphs

C++ Algorithm Series: Advanced Graphs
MP4 | Video: AVC 1280×720 | Audio: AAC 44KHz 2ch | Duration: 2 Hours 17M | 361 MB
Genre: eLearning | Language: English

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.

DOWNLOAD
(Buy premium account for maximum speed and resuming ability)