Applications: Kruskal MST, Dynamic Connectivity, Equivalence Classes
This generated surface maps a learner-facing curriculum unit to its canonical source routes.
Curriculum surface
- Open learner-facing unit
- Curriculum path:
content/curriculum/foundations/semester-02-algorithms/module-05-advanced-structures/concepts/cluster-02-union-find-and-disjoint-set-structures/07-applications-kruskal-mst-dynamic-connectivity-equivalence-classes-primary.md - App:
foundations - Semester:
semester-02-algorithms - Module:
module-05-advanced-structures - Unit kind:
concept - Curation level:
generated_default
Learning objectives
- Explain Applications: Kruskal MST, Dynamic Connectivity, Equivalence Classes in the language of the current curriculum, not just the source book.
- Apply Applications: Kruskal MST, Dynamic Connectivity, Equivalence Classes to one concrete learner task or example inside this semester.
- Use
competitive-programming,introduction-to-algorithms-clrs,the-algorithm-design-manualas a selective source of truth when the learner-facing explanation is not enough.
Prerequisites
- The earlier concept pages and practice tasks in the current module.
Source books
competitive-programmingintroduction-to-algorithms-clrsthe-algorithm-design-manual
Source routes
Competitive Programming
- /books/competitive-programming via
Competitive Programming: 2.4.2 Union-find disjoint sets
Introduction To Algorithms Clrs
- /books/introduction-to-algorithms-clrs/chapter-01-algorithms via
CLRS: Kruskal and Prim (Part 1) - /books/introduction-to-algorithms-clrs/chapter-02-insertion-sort via
CLRS: Kruskal and Prim (Part 2) - /books/introduction-to-algorithms-clrs/chapter-19-disjoint-set-operations via
CLRS: Analysis of union by rank with path compression (Part 4)
The Algorithm Design Manual
- /books/the-algorithm-design-manual/chapter-15-graph-problems-polynomial-time via
Skiena: 15.3 Minimum spanning tree (Part 1),Skiena: 15.3 Minimum spanning tree (Part 2)
Supporting curriculum routes
No supporting curriculum routes linked yet.
External enrichment
No curated enrichment resources yet.
AI companion modes
- Explain simply
- Socratic tutor
- Quiz me
- Challenge my understanding
- Diagnose my confusion
- Generate extra practice
- Revision mode
- Connect forward / backward
Source-of-truth note
This teaching unit is learner-facing guidance assembled from multiple canonical book routes. Use the listed source books as the primary conceptual spine for Applications: Kruskal MST, Dynamic Connectivity, Equivalence Classes, and treat outside material as supporting enrichment only.