, Parent, FindCompress&gt; dsets(rank, p);
  
  for (ui  = vertices(G).first; ui != vertices(G).second; ++ui)
    dsets.make_set(*ui);
  ...
  while ( !Q.empty() ) {
    e = Q.front();
    Q.pop();
    u = dsets.find_set(source(e));
    v = dsets.find_set(target(e));
    if ( u != v ) {
      *out++ = e;
      dsets.link(u, v);
    }
  }
</pre>

  <h3>Members</h3>

  <table border summary="">
    <tr>
      <th>Member</th>

      <th>Description</th>
    </tr>

    <tr>
      <td><tt>disjoint_sets(Rank r, P