Learn Graph Algorithms With C++

Lets implement graph theory related algorithms with C++

What you'll learn
Thorough understanding about graph algorithms and how to use them in practice
Requirements
Beginner level programming knowledge in C++
Description
Graph theory hold corner stone of modern computer science, extending its tentacles  to social networks to neural networks to finding paths in maps. In this course we are looking at graph theory by computer science prospective. We are going to start our discussion by looking at the basic terms of graph theory and them jump on to discuss graph theory related algorithms and then implement those with c++. Following are the types of algorithms we are going to discuss in this course.
1. Graph traversing.
2. Topological sorting and strongly connected component associated algorithms
3. Shortest paths.
4. Finding minimum spanning trees.
5. Maximum flow.
6. NP complete algorithms such as graph coloring, traveling salesman problem etc.  


Overview

Section 1: Introduction to graph theory

Lecture 1 Some points before you start

Lecture 2 Introduction

Lecture 3 Lets learn some jargon part 1

Lecture 4 Lets learn some jargon part 2

Section 2: Graph representation

Lecture 5 Adjacency matrix representation of a graph

Lecture 6 Adjacency list representation of a graph

Lecture 7 Comparison between two implementations

Section 3: Graph traversing algorithms

Lecture 8 Breadth first search

Lecture 9 Breadth first search implementation

Lecture 10 Depth first search

Lecture 11 Predecessor sub graphs

Lecture 12 Classification of edges in predecessor sub graph

Lecture 13 Topological search of a directed graph

Lecture 14 Topological sort implementation

Lecture 15 Strongly connected component of a graph

Lecture 16 Strongly connected component of a graph implementation

Section 4: Shortest path in a graph

Lecture 17 Shortest path algorithms introduction

Lecture 18 Bellman ford algorithm

Lecture 19 Bellman ford algorithm implementation

Lecture 20 Shortest path in DAG

Lecture 21 Dijkstra's algorithm of finding shortest path

Lecture 22 Dijkstra's algorithm of finding shortest path explanation

Lecture 23 Dijkstra's algorithm of finding shortest path implementation

Section 5: Minimum spanning tree problem

Lecture 24 Minimum spanning tree introduction

Lecture 25 MST- Kruskal's algorithm introduction part 1

Lecture 26 MST-Kruskal's algorithm introduction part 2

Lecture 27 MST-Kruskal's algorithm implementation

Lecture 28 MST-Prims algorithm introduction

Lecture 29 MST-Prims algorithm implementation

Section 6: Flow networks

Lecture 30 Introduction to flow networks

Lecture 31 Max flow min cut theorem

Any C++ programmer who wants to learn Graph theory