HP MLIB User's Guide Vol. 2 7th Ed.

976 HP MLIB User’s Guide
mlib_METIS_mCPartGraphKway Partitions a graph
Name mlib_METIS_mCPartGraphKway
Partitions a graph
Purpose This function is used to partition a graph into k parts such that multiple
balancing constraints are satisfied. It uses the multi-constraint multilevel
k-way partitioning algorithm. It provides the functionality of the kmetis
program when it is used to compute a multi-constraint partitioning. The object
of the partitioning is to minimize the edgecut.
Usage VECLIB:
void mlib_METIS_mCPartGraphKway (int *n, int *ncon, int *xadj, int
*adjncy, int *vwgt, int *adjwgt, int *wgtflag, int *numflag, int *nparts,
int *ubvec, int *options, int *edgecut, int *part)
VECLIB8:
void mlib_METIS_mCPartGraphKway (long long *n, long long *ncon,
long long *xadj, long long *adjncy, long long *vwgt, long long *adjwgt,
long long *wgtflag, long long *numflag, long long *nparts, long long
*ubvec, long long *options, long long *edgecut, long long *part)
Arguments n The number of vertices in the graph.
ncon The number of constraints. This should be greater than
one and smaller than 15.
xadj,
adjncy
The adjacency structure of the graph.
vwgt,
adjwgt
Information about the weights of the vertices and
edges. Note that the weight vector must be supplied
and it should be of size n*ncon.
wgtflag Used to indicate if the graph is weighted. wgtflag can
take the following values:
0—No weights (adjwgt is NULL)
1—Weights on the edges
numflag Used to indicate which numbering scheme is used for
the adjacency structure of the graph. numflag can take
the following two values:
0—C-Style numbering is assumed that starts from 0
1—Fortran-style numbering is assumed that starts
from 1
nparts The number of parts to partition the graph.