#include "metislib.h"
Go to the source code of this file.
Functions | |
void | GrowBisection (ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts, idx_t niparts) |
void | GrowBisectionNode (ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts, idx_t niparts) |
void | GrowBisectionNode2 (ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts, idx_t niparts) |
void | Init2WayPartition (ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts, idx_t niparts) |
void | InitSeparator (ctrl_t *ctrl, graph_t *graph, idx_t niparts) |
void | McGrowBisection (ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts, idx_t niparts) |
void | McRandomBisection (ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts, idx_t niparts) |
void | RandomBisection (ctrl_t *ctrl, graph_t *graph, real_t *ntpwgts, idx_t niparts) |
This function takes a graph and produces a bisection by using a region growing algorithm. The resulting bisection is refined using FM. The resulting partition is returned in graph->where.
Definition at line 189 of file initpart.c.
Definition at line 433 of file initpart.c.
Definition at line 570 of file initpart.c.
This function computes the initial bisection of the coarsest graph
Definition at line 19 of file initpart.c.
This function computes the initial separator of the coarsest graph
Definition at line 67 of file initpart.c.
This function takes a multi-constraint graph and produces a bisection by using a region growing algorithm. The resulting partition is returned in graph->where.
Definition at line 385 of file initpart.c.
This function takes a multi-constraint graph and computes a bisection by randomly assigning the vertices and then refining it. The resulting partition is returned in graph->where.
Definition at line 325 of file initpart.c.
This function computes a bisection of a graph by randomly assigning the vertices followed by a bisection refinement. The resulting partition is returned in graph->where.
Definition at line 114 of file initpart.c.