This is a session on competitive programming, for 2nd years IIT(ISM) Dhanbad.
Topic: Graphs - 5 (DSU and MST)
Link to google doc used: https://docs.google.com/document/d/1_vN_X5AfPH_r8ZQgHb56z4F_R89jBgJE1GO5XSVGWPg/edit#heading=h.z9b9x9dxpvu3
Session taken by : Chirag Jain
This session would cover DSU (Disjoint Set Union) and algorithm for finding MST (Minimum Spanning Tree)
You may also go through the following blog in advance, for better understanding of the topic:
1. https://cp-algorithms.com/data_structures/disjoint_set_union.html
2. https://www.hackerearth.com/practice/algorithms/graphs/minimum-spanning-tree/tutorial/
View the complete CP Level 2 (CodeISM 2023) playlist at:
https://www.youtube.com/playlist?list=PL40a3hTWsqXBFAKwLv-02tsKOLCud6hvf
