22 int i, ii, j, k, kwgt, nvtxs, nbnd, nswaps, from, to, pass, me, limit, tmp;
23 idxtype *xadj, *vwgt, *adjncy, *adjwgt, *where, *id, *ed, *bndptr, *bndind, *pwgts;
26 int higain, oldgain, mincut, mindiff, origdiff, initcut, newcut, mincutorder, avgvwgt;
44 limit =
amin(
amax(0.01*nvtxs, 15), 100);
45 avgvwgt =
amin((pwgts[0]+pwgts[1])/20, 2*(pwgts[0]+pwgts[1])/nvtxs);
52 printf(
"Partitions: [%6d %6d] T[%6d %6d], Nv-Nb[%6d %6d]. ICut: %6d\n",
53 pwgts[0], pwgts[1], tpwgts[0], tpwgts[1], graph->
nvtxs, graph->
nbnd, graph->
mincut));
55 origdiff = abs(tpwgts[0]-pwgts[0]);
57 for (pass=0; pass<npasses; pass++) {
62 newcut = mincut = initcut = graph->
mincut;
63 mindiff = abs(tpwgts[0]-pwgts[0]);
71 for (ii=0; ii<nbnd; ii++) {
73 ASSERT(ed[bndind[i]] > 0 ||
id[bndind[i]] == 0);
74 ASSERT(bndptr[bndind[i]] != -1);
75 PQueueInsert(&parts[where[bndind[i]]], bndind[i], ed[bndind[i]]-
id[bndind[i]]);
78 for (nswaps=0; nswaps<nvtxs; nswaps++) {
79 from = (tpwgts[0]-pwgts[0] < tpwgts[1]-pwgts[1] ? 0 : 1);
84 ASSERT(bndptr[higain] != -1);
86 newcut -= (ed[higain]-
id[higain]);
87 INC_DEC(pwgts[to], pwgts[from], vwgt[higain]);
89 if ((newcut < mincut && abs(tpwgts[0]-pwgts[0]) <= origdiff+avgvwgt) ||
90 (newcut == mincut && abs(tpwgts[0]-pwgts[0]) < mindiff)) {
92 mindiff = abs(tpwgts[0]-pwgts[0]);
95 else if (nswaps-mincutorder > limit) {
96 newcut += (ed[higain]-
id[higain]);
97 INC_DEC(pwgts[from], pwgts[to], vwgt[higain]);
102 moved[higain] = nswaps;
103 swaps[nswaps] = higain;
106 printf(
"Moved %6d from %d. [%3d %3d] %5d [%4d %4d]\n", higain, from, ed[higain]-
id[higain], vwgt[higain], newcut, pwgts[0], pwgts[1]));
111 SWAP(
id[higain], ed[higain], tmp);
112 if (ed[higain] == 0 && xadj[higain] < xadj[higain+1])
115 for (j=xadj[higain]; j<xadj[higain+1]; j++) {
117 oldgain = ed[k]-
id[k];
119 kwgt = (to == where[k] ? adjwgt[j] : -adjwgt[j]);
123 if (bndptr[k] != -1) {
131 PQueueUpdate(&parts[where[k]], k, oldgain, ed[k]-
id[k]);
149 for (i=0; i<nswaps; i++)
150 moved[swaps[i]] = -1;
151 for (nswaps--; nswaps>mincutorder; nswaps--) {
152 higain = swaps[nswaps];
154 to = where[higain] = (where[higain]+1)%2;
155 SWAP(
id[higain], ed[higain], tmp);
156 if (ed[higain] == 0 && bndptr[higain] != -1 && xadj[higain] < xadj[higain+1])
158 else if (ed[higain] > 0 && bndptr[higain] == -1)
161 INC_DEC(pwgts[to], pwgts[(to+1)%2], vwgt[higain]);
162 for (j=xadj[higain]; j<xadj[higain+1]; j++) {
165 kwgt = (to == where[k] ? adjwgt[j] : -adjwgt[j]);
168 if (bndptr[k] != -1 && ed[k] == 0)
170 if (bndptr[k] == -1 && ed[k] > 0)
176 printf(
"\tMinimum cut: %6d at %5d, PWGTS: [%6d %6d], NBND: %6d\n", mincut, mincutorder, pwgts[0], pwgts[1], nbnd));
181 if (mincutorder == -1 || mincut == initcut)
#define BNDInsert(nbnd, bndind, bndptr, vtx)
#define IFSET(a, flag, cmd)
#define BNDDelete(nbnd, bndind, bndptr, vtx)
#define FM_2WayEdgeRefine
#define INC_DEC(a, b, val)