/*************************************************************************
* This function performs multilevel bisection
**************************************************************************/
void MlevelNodeBisection(CtrlType *ctrl, GraphType *graph, int *tpwgts, float ubfactor)
{
GraphType *cgraph;
ctrl->CoarsenTo = graph->nvtxs/8;
if (ctrl->CoarsenTo > 100)
ctrl->CoarsenTo = 100;
else if (ctrl->CoarsenTo < 40)
ctrl->CoarsenTo = 40;
ctrl->maxvwgt = 1.5*((tpwgts[0]+tpwgts[1])/ctrl->CoarsenTo);
cgraph = Coarsen2Way(ctrl, graph);
switch (ctrl->IType) {
case IPART_GGPKL:
Init2WayPartition(ctrl, cgraph, tpwgts, ubfactor);
IFSET(ctrl->dbglvl, DBG_TIME, starttimer(ctrl->SepTmr));
Compute2WayPartitionParams(ctrl, cgraph);
ConstructSeparator(ctrl, cgraph, ubfactor);
IFSET(ctrl->dbglvl, DBG_TIME, stoptimer(ctrl->SepTmr));
break;
case IPART_GGPKLNODE:
InitSeparator(ctrl, cgraph, ubfactor);
break;
}
Refine2WayNode(ctrl, graph, cgraph, ubfactor);
}
/*************************************************************************
* This function performs multilevel bisection
**************************************************************************/
void MlevelEdgeBisection(CtrlType *ctrl, GraphType *graph, int *tpwgts, floattype ubfactor)
{
GraphType *cgraph;
cgraph = Coarsen2Way(ctrl, graph);
Init2WayPartition(ctrl, cgraph, tpwgts, ubfactor);
Refine2Way(ctrl, graph, cgraph, tpwgts, ubfactor);
/*
IsConnectedSubdomain(ctrl, graph, 0);
IsConnectedSubdomain(ctrl, graph, 1);
*/
}