Minimum cut

A graph and two of its cuts. The dotted line in red represents a cut with three crossing edges. The dashed line in green represents one of the minimum cuts of this graph, crossing only two edges.

In graph theory, a minimum cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets that are joined by at least one edge) that is minimal in some sense. Variations of the minimum cut include:

单词	Min cut
释义	Min cut 英语百科 Minimum cut In graph theory, a minimum cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets that are joined by at least one edge) that is minimal in some sense. Variations of the minimum cut include:
随便看	Beketovka的意思 Beketovskaya的意思 be keyed up的意思 be key to的意思 Bekh的意思 Bekhterev的意思 Bekhterev arthritis的意思 Bekhterev disease的意思 bekhterev layer的意思 Bekhterev Mendel reflex的意思 bekhterev nucleus的意思 Bekhterev reaction的意思 bekhterev reflex的意思 Bekhterev sign的意思 bekhterev spondylitis的意思 bekhterev symptom的意思 Bekhterev technique的意思 Bekhterev Test的意思 Bekhterev test letter的意思 Bekhterev tract的意思 Bekhtery的意思 Beki的意思 be kicking it的意思 be kidding的意思 be killed的意思

Min cut

Minimum cut