class_docstr: A cut of a given graph.
  
  This is a simple class used to represent cuts returned by
  L{Graph.mincut()}, L{Graph.all_st_cuts()} and other functions
  that calculate cuts.
  
  A cut is a special vertex clustering with only two clusters.
  Besides the usual L{VertexClustering} methods, it also has the
  following attributes:
  
    - C{value} - the value (capacity) of the cut. It is equal to
      the number of edges if there are no capacities on the
      edges.
  
    - C{partition} - vertex IDs in the parts created
      after removing edges in the cut
  
    - C{cut} - edge IDs in the cut
  
    - C{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"
code: def __str__(self):
      return "Graph cut (%d edges, %d vs %d vertices, value=%.4f)" % (
          len(self._cut),
          len(self._partition),
          self._graph.vcount() - len(self._partition),
          self._value,
      )
  
imports: from igraph._igraph import GraphBase
  from igraph.clustering import VertexClustering
label_desc: Use image node_id 3 for calling the Cut obj's underlying member method code with example usage: obj.__str__() and returns: unknown