Hello, Codeforces community↵
↵
The Club of Programmers, IIT BHU is excited to announce the launch of Graph Theory playlist of COPS YouTube channel.↵
↵
The playlist contains some basic and intermediate concepts of graph theory. The videos and the corresponding document not only provide explanation to the concept but also provide a proper roadmap on how to study these concepts along with the practice problems.↵
↵
Graph Theory Playlist link : [https://www.youtube.com/playlist?list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7](https://www.youtube.com/playlist?list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7)↵
↵
Following topics are covered in the playlist:↵
↵
- [Basic graph theory (Terminologies, dfs and bfs)](https://www.youtube.com/watch?v=egUxXxnASDU&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=1)↵
↵
- [Dijkstra algorithm: Single source shortest path algorithm](https://www.youtube.com/watch?v=3lap9xe7RSQ&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=3&t=10s)↵
↵
- [Other Shortest Path Algorithms (Bellman Ford and Floyd Warshall)](https://www.youtube.com/watch?v=4y-4UycCEzg&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=4)↵
↵
- [Introduction to trees and subtree queries](https://www.youtube.com/watch?v=ikadzQ34jUc&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=5&t=7s)↵
↵
- [Disjoint Set Union (Basics)](https://www.youtube.com/watch?v=6LSxGJlXoTk&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=6&t=234s)↵
↵
- [Minimum Spanning Tree — Kruskal's Algorithm](https://www.youtube.com/watch?v=xvqTngd2uOw&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=7&t=370s)↵
↵
- [Minimum Spanning Tree — Prims's Algorithm](https://www.youtube.com/watch?v=o_pWmvv_Nys&t=973s)↵
↵
- [Topological Sort and Strongly Connected Components](https://www.youtube.com/watch?v=NDKbytYWGis&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=9&t=874s)↵
↵
.. and we will also be covering some advanced concepts of graph theory soon. Before that, stay updated for upcoming dynamic programming playlist and do subscribe to our channel.↵
↵
**The videos are in a mix of Hindi and English.**↵
↵
↵
↵
The Club of Programmers, IIT BHU is excited to announce the launch of Graph Theory playlist of COPS YouTube channel.↵
↵
The playlist contains some basic and intermediate concepts of graph theory. The videos and the corresponding document not only provide explanation to the concept but also provide a proper roadmap on how to study these concepts along with the practice problems.↵
↵
Graph Theory Playlist link : [https://www.youtube.com/playlist?list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7](https://www.youtube.com/playlist?list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7)↵
↵
Following topics are covered in the playlist:↵
↵
- [Basic graph theory (Terminologies, dfs and bfs)](https://www.youtube.com/watch?v=egUxXxnASDU&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=1)↵
↵
- [Dijkstra algorithm: Single source shortest path algorithm](https://www.youtube.com/watch?v=3lap9xe7RSQ&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=3&t=10s)↵
↵
- [Other Shortest Path Algorithms (Bellman Ford and Floyd Warshall)](https://www.youtube.com/watch?v=4y-4UycCEzg&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=4)↵
↵
- [Introduction to trees and subtree queries](https://www.youtube.com/watch?v=ikadzQ34jUc&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=5&t=7s)↵
↵
- [Disjoint Set Union (Basics)](https://www.youtube.com/watch?v=6LSxGJlXoTk&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=6&t=234s)↵
↵
- [Minimum Spanning Tree — Kruskal's Algorithm](https://www.youtube.com/watch?v=xvqTngd2uOw&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=7&t=370s)↵
↵
- [Minimum Spanning Tree — Prims's Algorithm](https://www.youtube.com/watch?v=o_pWmvv_Nys&t=973s)↵
↵
- [Topological Sort and Strongly Connected Components](https://www.youtube.com/watch?v=NDKbytYWGis&list=PLLt4yMoVgczV8N1LTzA6eXoWlXU9MTQv7&index=9&t=874s)↵
↵
.. and we will also be covering some advanced concepts of graph theory soon. Before that, stay updated for upcoming dynamic programming playlist and do subscribe to our channel.↵
↵
**The videos are in a mix of Hindi and English.**↵
↵
↵
