This is going to be a complete video lecture series on graph theory covering concepts in details with implementation details and practice problems to make concepts clear and gain confidence.

There are going to be 3 parts of the while series , each part having difficulty level a little higher than the previous part and also part 2 and part 3 are designed such that they use knowledge of previous parts.

here are the list of topics we could be covering in part 1

L00 : Course Overview

L01 : Graph Representation

L02 : Depth First Search

L03 : Finding Connected Components

L03.1 : Practice Problem 1

L04 : SSSP (single source shortest path) on trees using DFS

L04.1 : Practice Problem 2

L04.2 : Practice Problem 3

L05 : Bipartite graph Test(two coloring)

L05.1 : Practice Problem 4

L06 : Cycle Detection

L07 : In / Out Time of Nodes

L07.1 : Practice Problem 5

L08 : Finding diameter of a Tree

L08.1 : Longest path in tree (Spoj)

L09 : Calculating subtree size using DFS

L10 : Breadth First Search (SSSP : unweighted graph)

L10.1 : Monk and the islands (HackerEarth) | Breadth First Search

L10.2 :Prime Path (Spoj : Not Easy Problem)

L10.4 : Social Networking Graph | HackerEarth

L10.3 :Feasible Relation | HackerEarth

E003 : Beautiful Graph | CF (Rated 1600)

L11 : Finding Bridges | Part 1

L11 : Finding Bridges | Part 2 (Implementation)

L12 : Articulation Point and Relation with Bridges

L13 : Finding Articulation Points

L13.1 : SUBMERGE(Spoj)

L14 : Topological Sorting Introduction

L15 : Kahn’s Algorithm for Topological Sort

L16 : TOPOSORT (Spoj) | Topological Sort Practice Problem

L17 : Introduction of graph algorithms on 2D Grid

L18 : Applying dfs on 2D Grid

L19 : Counting connected components on grid

E01 : Counting Rooms | CSES | Graph Algorithms

L20 : BFS on 2D Grid

E001 : Jungle Run | HackerEarth | Graph & Tree

L21 : Finding Euler Circuit

After lecture 10 , i would host a contest on vjudge so that you can see for yourself that how good you have understood concepts covered till lecture 10.

Your suggestion / support is needed for this channel(CodeNCode) to grow.

Thank you for your valuable time.

CodeNCode.