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

Chapter 14 METIS Routines 967
Partitions a graph Graph Partitioning Routines
Graph Partitioning Routines
The following sections describe the graph partitioning routines included with
METIS.
Name mlib_METIS_PartGraphRecursive
Partitions a graph
Purpose This function is used to partition a graph into k equal-size parts using
multilevel recursive bisection. It provides the functionality of the pmetis
program. The objective of the partitioning is to minimize the edgecut.
Usage VECLIB:
void mlib_METIS_PartGraphRecursive (int *n, int *xadj, int *adjncy, int
*vwgt, int *adjwgt, int *wgtflag, int *numflag, int *nparts, int *options,
int *edgecut, int *part)
VECLIB8:
void mlib_METIS_PartGraphRecursive (long long *n, long long *xadj,
long long *adjncy, long long *vwgt, long long *adjwgt, long long *wgtflag,
long long *numflag, long long *nparts, long long *options, long long
*edgecut, long long *part)
Arguments n The number of vertices in the graph.
xadj,
adjncy
The adjacency structure of the graph.
vwgt,
adjwgt
Information about the weights of the vertices and
edges.
wgtflag Used to indicate if the graph is weighted. wgtflag can
take the following values:
0—No weights (vwgt and adjwgt are NULL)
1—Weights on the edges only (vwgt=NULL)
2—Weights on the vertices only (adjwgt=NULL)
3—Weights both on vertices and edges