(self, source, target)
return [
            Cut(self, cut=cut, partition=part)
            for cut, part in zip(*GraphBase.all_st_cuts(self, source, target))
        ]
\
        Returns all the cuts between the source and target vertices in a
        directed graph.

        This function lists all edge-cuts between a source and a target vertex.
        Every cut is listed exactly once.

        @param source: the source vertex ID
        @param target: the target vertex ID
        @return: a list of L{Cut} objects.

        @newfield ref: Reference
        @ref: JS Provan and DR Shier: A paradigm for listing (s,t)-cuts in
          graphs. Algorithmica 15, 351--372, 1996.
\
        Returns all the cuts between the source and target vertices in a
        directed graph.
\ Returns all the cuts between the source and target vertices in a directed graph .
def all_st_cuts(self, source, target):
        """\
        Returns all the cuts between the source and target vertices in a
        directed graph.

        This function lists all edge-cuts between a source and a target vertex.
        Every cut is listed exactly once.

        @param source: the source vertex ID
        @param target: the target vertex ID
        @return: a list of L{Cut} objects.

        @newfield ref: Reference
        @ref: JS Provan and DR Shier: A paradigm for listing (s,t)-cuts in
          graphs. Algorithmica 15, 351--372, 1996.
        """
        return [
            Cut(self, cut=cut, partition=part)
            for cut, part in zip(*GraphBase.all_st_cuts(self, source, target))
        ]
def all_st_cuts ( self , source , target ) : return [ Cut ( self , cut = cut , partition = part ) for cut , part in zip ( * GraphBase . all_st_cuts ( self , source , target ) ) ]