metis partgraphrecursive (integer
n,
integer (*)
xadj,
integer (*)
adjncy,
integer (*)
vwgt,
integer (*)
adjwgt,
integer
wgtflag,
integer
numflag,
integer
nparts,
integer (*)
options,
integer
edgecut,
integer (*)
part)
Description
The
METIS PartGraphRecursive
function performs a mapping onto the com-
plete graph of the graph represented by arrays
xadj
,
adjncy
,
vwgt
and
adjwgt
, using the default
Scotch
mapping strategy. The
options
array
is not used. The
part
array has the same meaning as the
parttab
array
of
Scotch
. To date, the computation of the
edgecut
field requires extra
processing, which increases running time to a small extent.
All of the three
MeTiS
stubs
METIS PartGraphKway
,
METIS PartGraph
Recursive
and
METIS PartGraphVKway
call the same
Scotch
routine, which
uses the
Scotch
default mapping strategy proved to be efficient in most cases.
7.14.6
METIS PartGraphVKway
Synopsis
void METIS PartGraphVKway (const int * const
n,
const int * const
xadj,
const int * const
adjncy,
const int * const
vwgt,
const int * const
vsize,
const int * const
wgtflag,
const int * const
numflag,
const int * const
nparts,
const int * const
options,
int * const
volume,
int * const
part)
metis partgraphvkway (integer
n,
integer (*)
xadj,
integer (*)
adjncy,
integer (*)
vwgt,
integer (*)
vsize,
integer
wgtflag,
integer
numflag,
integer
nparts,
integer (*)
options,
integer
volume,
integer (*)
part)
125