code: def _all_st_mincuts(graph, source, target, capacity=None):
      """\
      Returns all the mincuts between the source and target vertices in a
      directed graph.
  
      This function lists all minimum edge-cuts between a source and a target
      vertex.
  
      B{Reference}: JS Provan and DR Shier: A paradigm for listing (s,t)-cuts in
      graphs. I{Algorithmica} 15, 351-372, 1996.
  
      @param source: the source vertex ID
      @param target: the target vertex ID
      @param capacity: the edge capacities (weights). If C{None}, all
        edges have equal weight. May also be an attribute name.
      @return: a list of L{Cut} objects.
      """
      value, cuts, parts = GraphBase.all_st_mincuts(
          graph, source, target, capacity
      )
      return [
          Cut(graph, value, cut=cut, partition=part)
          for cut, part in zip(cuts, parts)
      ]
  
imports: from igraph._igraph import GraphBase
  from igraph.clustering import VertexClustering
label_desc: Use image node_id 2 for calling a global function with example usage: _all_st_mincuts(graph, source, target, capacity) and returns: unknown