on
      objects.</td>
    </tr>
  </table>

  <h3>Example</h3>

  <p>A typical usage pattern for <tt>disjoint_sets</tt> can be seen in the
  <a href=
  "../graph/doc/kruskal_min_spanning_tree.html"><tt>kruskal_minimum_spanning_tree()</tt></a>
  algorithm. In this example, we call <tt>link()</tt> instead of
  <tt>union_set()</tt> because <tt>u</tt> and <tt>v</tt> were obtained from
  <tt>find_set()</tt> and therefore are already the representatives for their
  sets.</p>
  <pre>
  ...
  disjoint_sets&lt;Rank