void GrowBisectionNode2(ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts,
idx_t niparts)
{
idx_t i, j, k, nvtxs, bestcut=0, mincut, inbfs;
idx_t *xadj, *where, *bndind, *bestwhere;
WCOREPUSH;
nvtxs = graph->nvtxs;
xadj = graph->xadj;
/* Allocate refinement memory. Allocate sufficient memory for both edge and node */
graph->pwgts = imalloc(3, "GrowBisectionNode: pwgts");
graph->where = imalloc(nvtxs, "GrowBisectionNode: where");
graph->bndptr = imalloc(nvtxs, "GrowBisectionNode: bndptr");
graph->bndind = imalloc(nvtxs, "GrowBisectionNode: bndind");
graph->id = imalloc(nvtxs, "GrowBisectionNode: id");
graph->ed = imalloc(nvtxs, "GrowBisectionNode: ed");
graph->nrinfo = (nrinfo_t *)gk_malloc(nvtxs*sizeof(nrinfo_t), "GrowBisectionNode: nrinfo");
bestwhere = iwspacemalloc(ctrl, nvtxs);
where = graph->where;
bndind = graph->bndind;
for (inbfs=0; inbfs<niparts; inbfs++) {
iset(nvtxs, 1, where);
if (inbfs > 0)
where[irandInRange(nvtxs)] = 0;
Compute2WayPartitionParams(ctrl, graph);
General2WayBalance(ctrl, graph, ntpwgts);
FM_2WayRefine(ctrl, graph, ntpwgts, ctrl->niter);
/* Construct and refine the vertex separator */
for (i=0; i<graph->nbnd; i++) {
j = bndind[i];
if (xadj[j+1]-xadj[j] > 0) /* ignore islands */
where[j] = 2;
}
Compute2WayNodePartitionParams(ctrl, graph);
FM_2WayNodeRefine2Sided(ctrl, graph, 4);
/*
printf("ISep: [%"PRIDX" %"PRIDX" %"PRIDX" %"PRIDX"] %"PRIDX"\n",
inbfs, graph->pwgts[0], graph->pwgts[1], graph->pwgts[2], bestcut);
*/
if (inbfs == 0 || bestcut > graph->mincut) {
bestcut = graph->mincut;
icopy(nvtxs, where, bestwhere);
}
}
graph->mincut = bestcut;
icopy(nvtxs, bestwhere, where);
WCOREPOP;
}
/*************************************************************************
* This function is the entry point of the bisection balancing algorithms.
**************************************************************************/
void Balance2Way(CtrlType *ctrl, GraphType *graph, int *tpwgts, float ubfactor)
{
int mindiff;
/* Return right away if the balance is OK */
mindiff = abs(tpwgts[0]-graph->pwgts[0]);
if (mindiff < 3*(graph->pwgts[0]+graph->pwgts[1])/graph->nvtxs)
return;
if (graph->pwgts[0] > tpwgts[0] && graph->pwgts[0] < (int)(ubfactor*tpwgts[0]))
return;
if (graph->pwgts[1] > tpwgts[1] && graph->pwgts[1] < (int)(ubfactor*tpwgts[1]))
return;
if (graph->nbnd > 0)
Bnd2WayBalance(ctrl, graph, tpwgts);
else
General2WayBalance(ctrl, graph, tpwgts);
}
