data-structures-for-disjoint-sets
CommunityExplain and analyze disjoint-set structures.
Software Engineering#graphs#data-structures#algorithm-analysis#union-find#path-compression#disjoint-set#inverse-ackermann
AuthorArcadi4
Version1.0.0
Installs0
System Documentation
What problem does it solve?
This skill helps you reason about disjoint-set data structures (union-find) and correctness of MAKE-SET, FIND-SET, and UNION, while comparing representations (linked lists vs forests) and their impact on performance invariants.
Core Features & Use Cases
- Understand partition invariants and representative contracts for dynamic connectivity problems.
- Analyze performance bounds including amortized costs and inverse-Ackermann, across union-by-rank and path compression variants.
- Apply to offline algorithms such as offline minimum and Tarjan offline LCA, as well as general incremental connectivity tasks.
Quick Start
Run a complete DSU walkthrough: initialize sets with MAKE-SET, perform unions for graph edges, then answer connectivity queries with FIND-SET.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: data-structures-for-disjoint-sets Download link: https://github.com/Arcadi4/nerdy/archive/main.zip#data-structures-for-disjoint-sets Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.