[[TableOfContents]]
= ê³„íš =
 * Disjoint Sets
 * Union-Find
   * Union
   * Find
   * ìµœì í™” ê¸°ë²•
      * Rankë¥¼ ì´ìš©í•œ ìµœì í™” ê¸°ë²•
      * Heightë¥¼ ì´ìš©í•œ ìµœì í™” ê¸°ë²•
      * Path Compressionì„ ì´ìš©í•œ ìµœì í™” ê¸°ë²•
 
   

= ì°¸ì—¬ìž =
||ê°•ì‚¬ || [ê¶Œì˜ê¸°] ||
||<|10> ì°¸ì—¬ìž||  ||
||  ||
||  ||
||  ||
||  ||
||  ||
= ë‚´ìš© =
= í›„ê¸° =
 
= ìˆ™ì œ =
 * [https://algospot.com/judge/problem/read/EDITORWARS]
= ì°¸ì¡° = 
 * [https://www.cs.princeton.edu/~rs/AlgsDS07/01UnionFind.pdf]
 * í”„ë¡œê·¸ëž˜ë° ëŒ€íšŒì—ì„œ ë°°ìš°ëŠ” ì•Œê³ ë¦¬ì¦˜ ë¬¸ì œ í•´ê²° ì „ëžµ 2ì˜ Chapter 25 ìƒí˜¸ ë°°íƒ€ì  ì§‘í•©
 * 2013ë…„ í•œìƒìš© êµìˆ˜ë‹˜ ìžë£Œêµ¬ì¡° 5-7 Tree Disjoint Set ppt
----
[ìƒˆì‹¹êµì‹¤/2014], [ìƒˆì‹¹êµì‹¤/2014/ë‹¤ë¹ˆì¹˜ì¸ìž¬ë°˜]