(self, source, target, capacity=None)
return Cut(self, *GraphBase.st_mincut(self, source, target, capacity))
Calculates the minimum cut between the source and target vertices in a
        graph.

        @param source: the source vertex ID
        @param target: the target vertex ID
        @param capacity: the capacity of the edges. It must be a list or a valid
          attribute name or C{None}. In the latter case, every edge will have the
          same capacity.
        @return: the value of the minimum cut, the IDs of vertices in the
          first and second partition, and the IDs of edges in the cut,
          packed in a 4-tuple
Calculates the minimum cut between the source and target vertices in a
        graph.
Calculates the minimum cut between the source and target vertices in a graph .
def st_mincut(self, source, target, capacity=None):
        """Calculates the minimum cut between the source and target vertices in a
        graph.

        @param source: the source vertex ID
        @param target: the target vertex ID
        @param capacity: the capacity of the edges. It must be a list or a valid
          attribute name or C{None}. In the latter case, every edge will have the
          same capacity.
        @return: the value of the minimum cut, the IDs of vertices in the
          first and second partition, and the IDs of edges in the cut,
          packed in a 4-tuple
        """
        return Cut(self, *GraphBase.st_mincut(self, source, target, capacity))
def st_mincut ( self , source , target , capacity = None ) : return Cut ( self , * GraphBase . st_mincut ( self , source , target , capacity ) )