e.</td>
    </tr>
  </table>

  <h3>Complexity</h3>

  <p>The time complexity is <i>O(m alpha(m,n))</i>, where <i>alpha</i> is the
  inverse Ackermann's function, <i>m</i> is the number of disjoint-set
  operations (<tt>make_set()</tt>, <tt>find_set()</tt>, and <tt>link()</tt>
  and <i>n</i> is the number of elements. The <i>alpha</i> function grows
  very slowly, much more slowly than the <i>log</i> function.</p>

  <h3>See Also</h3><a href=
  "../graph/doc/incremental_components.html"><tt>incremental_conn