Class MinCut<T, W>
Compute minimum cut edges of given graph
using Edmond-Karps improved Ford-Fulkerson Max Flow Algorithm.
Assembly: Advanced.Algorithms.dll
Syntax
public class MinCut<T, W> : object where W : IComparable
Type Parameters
Constructors
MinCut(IFlowOperators<W>)
Declaration
public MinCut(IFlowOperators<W> operator)
Parameters
Methods
ComputeMinCut(IDiGraph<T>, T, T)
Declaration
public List<MinCutEdge<T>> ComputeMinCut(IDiGraph<T> graph, T source, T sink)
Parameters
Type |
Name |
Description |
IDiGraph<T> |
graph |
|
T |
source |
|
T |
sink |
|
Returns