# Maximum Cut¶

A maximum cut is a subset of a graph’s vertices such that the number of edges between this subset and the remaining vertices is as large as possible.

`maximum_cut` (G[, sampler]) |
Returns an approximate maximum cut. |

`weighted_maximum_cut` (G[, sampler]) |
Returns an approximate weighted maximum cut. |