Definition at line 43 of file hilb.cpp.
45{
46 int t, newtop;
48 int j = y;
49 while (
dad[i] >= 0) i =
dad[i];
50 while (
dad[j] >= 0) j =
dad[j];
51 if (i == j) return i;
54 {
55 newtop = j;
58 }
59 else
60 {
61 newtop = i;
64 }
66 {
70 }
72 {
73 t = y;
76 }
77
78 return newtop;
79}
References dad, n_sets, and x.
Referenced by merge_in(), and partition().