# Graph Theory Complete video series : Advanced algorithms (30 March 2020 : 1 lecture added)

Graph Theory Course : Part 2

You can find part 1 : Graph Theory Course : Part 1

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 whole 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 2
L00 : Course Overview
L01 : MST | Kruskalâ€™s Algorithm
L02 : Minimum Spanning Tree (HackerEarth) | Kruskalâ€™s Algorithm
L03 : Lowest Common Ancestor |Part 1
L04 : Lowest Common Ancestor | Part 2 | Binary Lifting
L05 : Distance between 2 nodes in tree in O(Log(N)) time using LCA
L06 : Spanning Tree With Maximum Degree | Codeforces DIV3 F1
L07 : Spanning Tree with one fixed degree | Codeforces DIV3 F2(Rated 2200)
L09 : SSSP | Dijkstraâ€™s Algorithm

L09 : Flow graphs and min / max flow
L10 : SSSP | Bellman-Ford Algorithm
L11 : All pairs shortest path | Floyd-Warshall Algorithm
L12 : Centroid Decomposition

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

Thank you for your valuable time.
CodeNCode

17 Likes

Bhai ek hi dil hain kitni bar jeeto ge

5 Likes

RunTime Error : SIGSEG-CHEE
Status : Backch*di overflow

lol just kidding man , thanks for complement.

5 Likes

Bhai itna uppar bhi mt chad ki neeche aane me TLE aa jaaye

3 Likes

Nice initiative Bro !!

Thank you man

1 Like

Bro have you made any video on DFS??

i have created a whole series on topics like dfs and bfs
here it is :

1 Like

23 Feb 2020 : 1 New video lecture added.
L02 : Minimum Spanning Tree (HackerEarth) | Kruskalâ€™s Algorithm

1 Like

soon , i am currently working on dp and graph theory.

1 Like

29 Feb 2020 : 1 video lecture added.
L03 : Lowest Common Ancestor |Part 1

2 Likes

6 march 2020 : 1 new video lecture added.
L04 : Lowest Common Ancestor | Part 2 | Binary Lifting

Was waiting for this. Tyâ€¦!

youâ€™re welcome

Thank you for this. I donâ€™t have a knowledge about trees though. Is it going to be okay for me to start graph theory from your lecture now?

Thanks !

start from graph theory part 1 series.
here is the link : Graph Theory Complete video series : part 1 (21 Feb 2020 - 2 New Practice Problem video added)

1 Like

youâ€™re welcome.
one advice : if you are getting started with graph theory you should start from this lecture series : Graph Theory Complete video series : part 1 (21 Feb 2020 - 2 New Practice Problem video added)

8 march 2020 : 1 new video lecture added.
L05 : Distance between 2 nodes in tree in O(Log(N)) time using LCA

2 Likes