convert string to lower-case, modifies string

Unsubscribes a callback from the event. Args: callback: The callback function to be removed.

Allows negative residuals

Verify an app name

wait until notified

/ ! This function allocates memory for 2-way node-based refinement */ /

/ ! This function allocates memory for 2-way edge refinement */ /

/ ! This function takes two ubfactor-centered load imbalance vectors x & y, and returns true if y is better balanced than x. */ /

* This function uses simple counting sort to return a permutation array * corresponding to the sorted order. The keys are arsumed to start from * 0 an

/ ! This function creates the coarser graph. Depending on the size of the candidate adjacency lists it either uses a hash table or an array to

Returns a power-of-2 factor s such that s*2^exp becomes closer to the interval [2^expmin, 2^expmax].

/ ! This function frees the memory associated with a ctrl_t */ /

------------------------ new added --------------------*/

/ ! This function matches the unmatched vertices using a 2-hop matching that involves vertices that are two hops away from each other. */ /

/ ! This function finds a matching using the HEM heuristic. The vertices are visited based on increasing degree to ensure that all vertices are

/ ! The top-level routine of the actual multilevel node bisection */ /

/ ! This function performs multilevel node bisection (i.e., tri-section). It performs multiple bisections and selects the best. */ /

/ ! This function performs multilevel node bisection (i.e., tri-section). It performs multiple bisections and selects the best. */ /

y^{k+1} = proj_{Y}(y^k + dDualStep * (b - A * (2x^{k+1} - x^{k})))

x^{k+1} = proj_{X}(x^k - dPrimalStep * (c - A'y^k))