* @brief Return patch version */

* @brief Zero the data for all clocks */

x = x + weight * y */

/ ! This function allocates memory for the workspace */ /

Asserts that variables have a state and basic status that is consistent with their bounds in the model.

/ ! This function checks if v+u2 provides a better balance in the weight vector that v+u1 */ /

* This function balances two partitions by moving boundary nodes * from the domain that is overweight to the one that is underweight. ****************

Returns a vector of basic statuses that is consistent with the basis and the bounds from the model.

Checks if A is a valid m-by-n matrix in CSC format. Returns 0 if OK and a negative value otherwise.

/ ! This function checks the validity of user-supplied parameters */ /

Checks if the vectors are valid LP data vectors. Returns 0 if OK and a negative value if a vector is invalid.

/ ! This function takes a graph and creates a sequence of coarser graphs. It implements the coarsening phase of the multilevel paradigm. */ /

/ ! This function takes a graph and creates a sequence of nlevels coarser graphs, where nlevels is an input parameter. */ /

/ ! This function compresses a graph by merging identical vertices The compression should lead to at least 10% reduction. The compressed gra

/ ! Computes the maximum load imbalance difference of a partitioning solution over all the constraints. The difference is defined with respe

Computes the pattern of L\AI[:,j] in topological order in pattern[top..m-1].

Computes the values of L\AI[:,j] scattered into lhs. Positions that are not in the pattern are not accessed. Returns the position of the maximum entry

* This function takes a bisection and constructs a minimum weight vertex * separator out of it. It uses the node-based separator refinement for it. *

/ ! This function performs a cut-focused FM refinement */ /

/ ! This function balances the left/right partitions of a separator tri-section */ /

/ ! This function performs a cut-focused multi-constraint FM refinement */ /

Returns a vector holding the indices of the largest and second largest entry in @weights. The index of the largest entry is at the back.

/ ! This function identifies the number of connected components in a graph that result after removing the vertices that belong to the vertex

/ ! This function frees the memory storing the structure of the graph */ /

/ ! This function frees the workspace */ /

* This function balances two partitions by moving the highest gain * (including negative gain) vertices to the other domain. * It is used only when t

/ ! This function takes a graph and produces a bisection by using a region growing algorithm. The resulting bisection is refined using FM. The

/ This function takes a graph and produces a tri-section into left, right, and separator using a region growing algorithm. The resulting separator

/ ! This function sets the default values for the options. \param options points to an array of size at least METIS_NOPTIONS. */ /