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>
where W : IComparable
Type Parameters
Constructors
MinCut(IFlowOperators<W>)
Declaration
public MinCut(IFlowOperators<W> operators)
Parameters
Methods
ComputeMinCut(WeightedDiGraph<T, W>, T, T)
Declaration
public List<MinCutEdge<T>> ComputeMinCut(WeightedDiGraph<T, W> graph, T source, T sink)
Parameters
Returns