25 int *nparts,
float *rubvec,
int *options,
int *edgecut,
37 if (options[0] == 0) {
81 int options[10], edgecut;
95 for (i=0; i<graph->
ncon; i++) {
102 options, &edgecut, cgraph->
where);
106 rubvec, options, &edgecut, cgraph->
where);
110 IFSET(ctrl->
dbglvl,
DBG_IPART, printf(
"Initial %d-way partitioning cut: %d\n", nparts, edgecut));
void METIS_mCPartGraphKway(int *nvtxs, int *ncon, idxtype *xadj, idxtype *adjncy, idxtype *vwgt, idxtype *adjwgt, int *wgtflag, int *numflag, int *nparts, float *rubvec, int *options, int *edgecut, idxtype *part)
#define MocRefineKWayHorizontal
#define MocAllocateKWayPartitionMemory
#define ComputePartitionInfo
#define AllocateWorkSpace
#define IFSET(a, flag, cmd)
#define Change2CNumbering
void METIS_mCPartGraphRecursiveInternal(int *nvtxs, int *ncon, idxtype *xadj, idxtype *adjncy, float *nvwgt, idxtype *adjwgt, int *nparts, int *options, int *edgecut, idxtype *part)
#define MATCH_SBHEM_INFNORM
void GKfree(void **ptr1,...)
void METIS_mCHPartGraphRecursiveInternal(int *nvtxs, int *ncon, idxtype *xadj, idxtype *adjncy, float *nvwgt, idxtype *adjwgt, int *nparts, float *ubvec, int *options, int *edgecut, idxtype *part)
#define MCMlevelKWayPartitioning
#define Change2FNumbering