V - the graph vertex typeE - the graph edge typeMinimumSTCutAlgorithm instead@Deprecated public class MinSourceSinkCut<V,E> extends Object
| Constructor and Description | 
|---|
MinSourceSinkCut(DirectedGraph<V,E> graph)
Deprecated.  
Create a new minimum s-t cut algorithm. 
 | 
MinSourceSinkCut(DirectedGraph<V,E> graph,
                double epsilon)
Deprecated.  
Create a new minimum s-t cut algorithm. 
 | 
MinSourceSinkCut(DirectedGraph<V,E> graph,
                MaximumFlowAlgorithm<V,E> maximumFlowAlgorithm,
                double epsilon)
Deprecated.  
Create a new minimum s-t cut algorithm. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
computeMinCut(V source,
             V sink)
Deprecated.  
Compute a minimum s-t cut 
 | 
V | 
getCurrentSink()
Deprecated.  
Returns the sink of the last call 
 | 
V | 
getCurrentSource()
Deprecated.  
Returns the source of the last call 
 | 
Set<E> | 
getCutEdges()
Deprecated.  
Let S be the set containing the source, and T be the set containing the sink, i.e. 
 | 
double | 
getCutWeight()
Deprecated.  
Get the cut weight. 
 | 
Set<V> | 
getSinkPartition()
Deprecated.  
Returns the minimum cut partition containing the sink 
 | 
Set<V> | 
getSourcePartition()
Deprecated.  
Get the minimum cut partition containing the source. 
 | 
public MinSourceSinkCut(DirectedGraph<V,E> graph)
graph - the input graphpublic MinSourceSinkCut(DirectedGraph<V,E> graph, double epsilon)
graph - the input graphepsilon - tolerance used when comparing floating point valuespublic MinSourceSinkCut(DirectedGraph<V,E> graph, MaximumFlowAlgorithm<V,E> maximumFlowAlgorithm, double epsilon)
graph - the input graphmaximumFlowAlgorithm - the maximum flow algorithm to useepsilon - tolerance used when comparing floating point valuespublic void computeMinCut(V source, V sink)
source - the sourcesink - the sinkpublic Set<V> getSourcePartition()
public Set<V> getSinkPartition()
public double getCutWeight()
public Set<E> getCutEdges()
public V getCurrentSource()
public V getCurrentSink()
Copyright © 2016. All rights reserved.