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

970 HP MLIB User’s Guide
mlib_METIS_PartGraphKway Partitions a graph
options[0]=1 then the remaining 4 elements of options
are interpreted as follows:
options[1] Determines matching type. Possible values
are:
1—Random Matching (RM)
2—Heavy-Edge Matching (HEM)
3—Sorted Heavy-Edge Matching (SHEM)(Default)
Experiments have shown that both HEM and SHEM
perform quite well.
options[2] Determines the algorithm used during
initial partioning. Possible values are:
1—Multilevel Recursive Bisection (Default)
options[3] Determines the algorithm used for
refinement. Possible values are:
1—Random Boundary Refinement
2—Greedy Boundary Refinement
3—Random Boundary Refinement that also minimizes
the connectivity among the subdomains (Default)
options[4] Used for debugging purposes. Always set it
to 0 (Default)
edgecut Upon successful completion, this variable stores the
number of edges that are cut by the partition.
part This is a vector of size n that upon successful
completion stores the partition vector of the graph. The
numbering of this vector starts from either 0 or 1,
depending on the value of numflag.
Notes This function should be used to partition a graph into a large number of
partitions (greater than 8). If a small number of partitions is desired, the
mlib_METIS_PartGraphRecursive routine should be used instead, as it
produces somewhat better partitions.