# Partitioning

A k-partition consists of k disjoint and equally sized subsets of a
graph’s vertices such that the total number of edges between nodes in
distinct subsets is as small as possible.

`partition` (G[, num_partitions, sampler]) |
Returns an approximate k-partition of G. |