Learn Graph algorithms with C++

Course Curriculum

Chapter 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

Chapter 2: Graph representation

Lecture 1: Adjacency matrix representation of a graph

Lecture 2: Adjacency list representation of a graph

Lecture 3: Comparison between two implementations

Chapter 3: Graph traversing algorithms

Lecture 1: Breadth first search

Lecture 2: Breadth first search implementation

Lecture 3: Depth first search

Lecture 4: Predecessor sub graphs

Lecture 5: Classification of edges in predecessor sub graph

Lecture 6: Topological search of a directed graph

Lecture 7: Topological sort implementation

Lecture 8: Strongly connected component of a graph

Lecture 9: Strongly connected component of a graph implementation

Chapter 4: Shortest path in a graph

Lecture 1: Shortest path algorithms introduction

Lecture 2: Bellman ford algorithm

Lecture 3: Bellman ford algorithm implementation

Lecture 4: Shortest path in DAG

Lecture 5: Dijkstra's algorithm of finding shortest path

Lecture 6: Dijkstra's algorithm of finding shortest path explanation

Lecture 7: Dijkstra's algorithm of finding shortest path implementation

Chapter 5: Minimum spanning tree problem

Lecture 1: Minimum spanning tree introduction

Lecture 2: MST- Kruskal's algorithm introduction part 1

Lecture 3: MST-Kruskal's algorithm introduction part 2

Lecture 4: MST-Kruskal's algorithm implementation

Lecture 5: MST-Prims algorithm introduction

Lecture 6: MST-Prims algorithm implementation

Chapter 6: Flow networks

Lecture 1: Introduction to flow networks

Lecture 2: Max flow min cut theorem