V
 the graph vertex typeE
 the graph edge typepublic interface MinimumSTCutAlgorithm<V,E>
Modifier and Type  Method and Description 

double 
calculateMinCut(V source,
V sink)
Computes a minimum capacity $st$ cut.

double 
getCutCapacity()
Returns the capacity of the cut obtained after the last invocation of
calculateMinCut(Object, Object) 
Set<E> 
getCutEdges()
Returns the set of edges which run from $S$ to $T$, in the $st$ cut obtained after the last
invocation of
calculateMinCut(Object, Object) In case of a directed graph, only the
edges with their tail in $S$ and their head in $T$ are returned. 
Set<V> 
getSinkPartition()
Returns the sink partition $T$, $t \in T$, of the cut obtained after the last invocation of
calculateMinCut(Object, Object) 
Set<V> 
getSourcePartition()
Returns the source partition $S$, $s \in S$, of the cut obtained after the last invocation of
calculateMinCut(Object, Object) 
double calculateMinCut(V source, V sink)
source
 ssink
 tdouble getCutCapacity()
calculateMinCut(Object, Object)
Set<V> getSourcePartition()
calculateMinCut(Object, Object)
Set<V> getSinkPartition()
calculateMinCut(Object, Object)
Set<E> getCutEdges()
calculateMinCut(Object, Object)
In case of a directed graph, only the
edges with their tail in $S$ and their head in $T$ are returned. In cased of a undirected
graph, all edges with one endpoint in $S$ and one endpoint in $T$ are returned.Copyright © 2018. All rights reserved.