/**
 * From a freshly-assigned `vertex_partition[]`, populate the rest of the k-way
 * refinement state: per-partition weights, per-vertex internal/external degree,
 * the neighbour-partition list (via `neighbor_partition_pool`), the boundary
 * list, and the total edge cut.
 *
 * Mirrors `ComputeKWayPartitionParams` from libmetis/kwayrefine.c, cut-objective
 * branch only.
 *
 * Boundary insertion rule (refinement-type boundary): a vertex is added to the
 * boundary when `external_degree >= internal_degree`. That captures "worth
 * considering for a move" — vertices with no external pull aren't candidates.
 *
 * @param {import('../MetisGraph.js').MetisGraph} graph
 * @param {number} partition_count
 */
export function compute_kway_params(graph: import('../MetisGraph.js').MetisGraph, partition_count: number): void;
//# sourceMappingURL=compute_kway_params.d.ts.map