Source Map — 10 Disjoint Set Union¶
এই folder-এর প্রতিটা idea, link, আর problem reference, তার origin আর copying status সহ। এই repo-তে problem descriptions সবসময় আমাদের নিজের ভাষায় rewrite করা; links official statements-এ point করে।
| Concept / Problem | Source Type | Source Name | Link | How it is used | Copying status |
|---|---|---|---|---|---|
| Friend-circles party analogy | Original | This repo | — | concept.md-তে শুরুর analogy | original explanation |
| Parent-array forest, find/union mechanics | Textbook-common knowledge | Standard CS curriculum; see also Open Data Structures | উৎস খুলুন | concept.md-তে memory picture | original explanation |
| Path compression and union by size/rank | Reference write-up | cp-algorithms, Disjoint Set Union | উৎস খুলুন | concept.md-তে optimizations; আমাদের লেখা independent | original explanation |
| Path halving variant in find | Reference write-up | cp-algorithms, Disjoint Set Union | উৎস খুলুন | implementation.py-তে code form + visual-explanation.md-তে note | original explanation |
| Inverse Ackermann α(n) friendly note | Textbook-common knowledge | Standard analysis (Tarjan); friendly framing ours | উৎস খুলুন | concept.md-তে "≤ 4 for any practical n" note | original explanation |
| Union/find frame-by-frame diagrams | Original | This repo | — | visual-explanation.md-র সব frame | original explanation |
| Interactive Union-Find animation | Visualizer | VisuAlgo (Union-Find module) | উৎস খুলুন | README.md আর visual-explanation.md-তে recommended | official link only |
| Kruskal's MST uses DSU as cycle guard | Textbook-common knowledge | Standard CS curriculum | উৎস খুলুন | concept.md-তে Pattern C | original explanation |
| Reverse-time (offline) deletion trick | Competitive-programming folklore | Covered across CP resources, e.g. USACO Guide | উৎস খুলুন | concept.md-তে Pattern E teaser | original explanation |
| Redundant Connection | Online judge | LeetCode 684 | উৎস খুলুন | Cycle-detection pattern + practice list | rewritten problem |
| Redundant Connection II | Online judge | LeetCode 685 | উৎস খুলুন | Hard practice list | rewritten problem |
| Number of Provinces | Online judge | LeetCode 547 | উৎস খুলুন | Component-count practice; DSU vs DFS comparison | rewritten problem |
| Find if Path Exists in Graph | Online judge | LeetCode 1971 | উৎস খুলুন | Easy connectivity practice | rewritten problem |
| Accounts Merge | Online judge | LeetCode 721 | উৎস খুলুন | Grouping pattern + practice list | rewritten problem |
| Satisfiability of Equality Equations | Online judge | LeetCode 990 | উৎস খুলুন | Equivalence-relation practice | rewritten problem |
| Smallest String With Swaps | Online judge | LeetCode 1202 | উৎস খুলুন | Grouping practice | rewritten problem |
| Most Stones Removed with Same Row or Column | Online judge | LeetCode 947 | উৎস খুলুন | Creative-keys practice | rewritten problem |
| Number of Operations to Make Network Connected | Online judge | LeetCode 1319 | উৎস খুলুন | Components + spare edges practice | rewritten problem |
| Graph Valid Tree | Online judge | LeetCode 261 | উৎস খুলুন | Cycle + count practice | rewritten problem |
| Number of Islands / Number of Islands II | Online judge | LeetCode 200 / 305 | উৎস খুলুন | Grid DSU practice; streaming variant | rewritten problem |
| Making A Large Island | Online judge | LeetCode 827 | উৎস খুলুন | Size-tracking practice | rewritten problem |
| Swim in Rising Water | Online judge | LeetCode 778 | উৎস খুলুন | Kruskal-flavor threshold practice | rewritten problem |
| Building Roads | Online judge | CSES task 1666 | উৎস খুলুন | "components − 1" practice + implementation.py-তে demo | rewritten problem |
| Road Construction | Online judge | CSES Problem Set (task name given) | উৎস খুলুন | Dynamic-connectivity practice | rewritten problem |
| General CP DSU ladder | Online judge | Codeforces problemset | উৎস খুলুন | CP-connection section-এর pointer | official link only |