A cut of a given graph.

This is a simple class used to represent cuts returned by Graph.mincut(), Graph.all_st_cuts() and other functions that calculate cuts.

A cut is a special vertex clustering with only two clusters. Besides the usual VertexClustering methods, it also has the following attributes:

• value - the value (capacity) of the cut. It is equal to the number of edges if there are no capacities on the edges.
• partition - vertex IDs in the parts created after removing edges in the cut
• cut - edge IDs in the cut
• es - an edge selector restricted to the edges in the cut.

You can use indexing on this object to obtain lists of vertex IDs for both sides of the partition.

This class is usually not instantiated directly, everything is taken care of by the functions that return cuts.

Examples:

>>> from igraph import Graph
>>> g = Graph.Ring(20)
>>> mc = g.mincut()
>>> print(mc.value)
2.0
>>> print(min(len(x) for x in mc))
1
>>> mc.es["color"] = "red"