/*************************************************************************
* This function computes the initial bisection of the coarsest graph
**************************************************************************/
void Init2WayPartition(CtrlType *ctrl, GraphType *graph, int *tpwgts, float ubfactor)
{
int dbglvl;
dbglvl = ctrl->dbglvl;
IFSET(ctrl->dbglvl, DBG_REFINE, ctrl->dbglvl -= DBG_REFINE);
IFSET(ctrl->dbglvl, DBG_MOVEINFO, ctrl->dbglvl -= DBG_MOVEINFO);
IFSET(ctrl->dbglvl, DBG_TIME, starttimer(ctrl->InitPartTmr));
switch (ctrl->IType) {
case IPART_GGPKL:
if (graph->nedges == 0)
RandomBisection(ctrl, graph, tpwgts, ubfactor);
else
GrowBisection(ctrl, graph, tpwgts, ubfactor);
break;
case 3:
RandomBisection(ctrl, graph, tpwgts, ubfactor);
break;
default:
errexit("Unknown initial partition type: %d\n", ctrl->IType);
}
IFSET(ctrl->dbglvl, DBG_IPART, printf("Initial Cut: %d\n", graph->mincut));
IFSET(ctrl->dbglvl, DBG_TIME, stoptimer(ctrl->InitPartTmr));
ctrl->dbglvl = dbglvl;
/*
IsConnectedSubdomain(ctrl, graph, 0);
IsConnectedSubdomain(ctrl, graph, 1);
*/
}
void Init2WayPartition(ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts,
idx_t niparts)
{
mdbglvl_et dbglvl;
ASSERT(graph->tvwgt[0] >= 0);
dbglvl = ctrl->dbglvl;
IFSET(ctrl->dbglvl, METIS_DBG_REFINE, ctrl->dbglvl -= METIS_DBG_REFINE);
IFSET(ctrl->dbglvl, METIS_DBG_MOVEINFO, ctrl->dbglvl -= METIS_DBG_MOVEINFO);
IFSET(ctrl->dbglvl, METIS_DBG_TIME, gk_startcputimer(ctrl->InitPartTmr));
switch (ctrl->iptype) {
case METIS_IPTYPE_RANDOM:
if (graph->ncon == 1)
RandomBisection(ctrl, graph, ntpwgts, niparts);
else
McRandomBisection(ctrl, graph, ntpwgts, niparts);
break;
case METIS_IPTYPE_GROW:
if (graph->nedges == 0)
if (graph->ncon == 1)
RandomBisection(ctrl, graph, ntpwgts, niparts);
else
McRandomBisection(ctrl, graph, ntpwgts, niparts);
else
if (graph->ncon == 1)
GrowBisection(ctrl, graph, ntpwgts, niparts);
else
McGrowBisection(ctrl, graph, ntpwgts, niparts);
break;
default:
gk_errexit(SIGERR, "Unknown initial partition type: %d\n", ctrl->iptype);
}
IFSET(ctrl->dbglvl, METIS_DBG_IPART, printf("Initial Cut: %"PRIDX"\n", graph->mincut));
IFSET(ctrl->dbglvl, METIS_DBG_TIME, gk_stopcputimer(ctrl->InitPartTmr));
ctrl->dbglvl = dbglvl;
}
void InitSeparator(ctrl_t *ctrl, graph_t *graph, idx_t niparts)
{
real_t ntpwgts[2] = {0.5, 0.5};
mdbglvl_et dbglvl;
dbglvl = ctrl->dbglvl;
IFSET(ctrl->dbglvl, METIS_DBG_REFINE, ctrl->dbglvl -= METIS_DBG_REFINE);
IFSET(ctrl->dbglvl, METIS_DBG_MOVEINFO, ctrl->dbglvl -= METIS_DBG_MOVEINFO);
IFSET(ctrl->dbglvl, METIS_DBG_TIME, gk_startcputimer(ctrl->InitPartTmr));
/* this is required for the cut-based part of the refinement */
Setup2WayBalMultipliers(ctrl, graph, ntpwgts);
switch (ctrl->iptype) {
case METIS_IPTYPE_EDGE:
if (graph->nedges == 0)
RandomBisection(ctrl, graph, ntpwgts, niparts);
else
GrowBisection(ctrl, graph, ntpwgts, niparts);
Compute2WayPartitionParams(ctrl, graph);
ConstructSeparator(ctrl, graph);
break;
case METIS_IPTYPE_NODE:
GrowBisectionNode(ctrl, graph, ntpwgts, niparts);
break;
default:
gk_errexit(SIGERR, "Unkown iptype of %"PRIDX"\n", ctrl->iptype);
}
IFSET(ctrl->dbglvl, METIS_DBG_IPART, printf("Initial Sep: %"PRIDX"\n", graph->mincut));
IFSET(ctrl->dbglvl, METIS_DBG_TIME, gk_stopcputimer(ctrl->InitPartTmr));
ctrl->dbglvl = dbglvl;
}
