Content:
- Union Find Naive
- Union Find Optimized
- Cycle Detection in Undirected Graph
- Kruskal's Algorithm
- Three related practices
File Structure:
- Handout (for students)
- Slides (for students)
- Code
- Union find
- Naive Version
- Optimized Version
- Time Comparison
- Cycle detection
- Kruskal's algorithm
- Application
- Q1. Number of Connected Components in an Undirected Graph
- Q2. Number of Islands
- Q3. Graph Valid Tree
- Union find