The top-level routines for multilevel k-way partitioning that minimizes the edge cut. More...
#include "metislib.h"
Go to the source code of this file.
Functions | |
void | InitKWayPartitioning (ctrl_t *ctrl, graph_t *graph) |
int | METIS_PartGraphKway (idx_t *nvtxs, idx_t *ncon, idx_t *xadj, idx_t *adjncy, idx_t *vwgt, idx_t *vsize, idx_t *adjwgt, idx_t *nparts, real_t *tpwgts, real_t *ubvec, idx_t *options, idx_t *objval, idx_t *part) |
idx_t | MlevelKWayPartitioning (ctrl_t *ctrl, graph_t *graph, idx_t *part) |
The top-level routines for multilevel k-way partitioning that minimizes the edge cut.
$Id: kmetis.c 13905 2013-03-25 13:21:20Z karypis $
Definition in file kmetis.c.
This function computes a k-way partitioning of a graph that minimizes the specified objective function.
ctrl | is the control structure |
graph | is the graph to be partitioned |
part | is the vector that on return will store the partitioning |