**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

L10 : Dijkstraâ€™s Algorithm Implementation

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