Show / Hide Table of Contents

    Class MinCut<T, W>

    Compute minimum cut edges of given graph using Edmond-Karps improved Ford-Fulkerson Max Flow Algorithm.

    Inheritance
    Object
    MinCut<T, W>
    Namespace: Advanced.Algorithms.Graph
    Assembly: Advanced.Algorithms.dll
    Syntax
    public class MinCut<T, W> : object where W : IComparable
    Type Parameters
    Name Description
    T
    W

    Constructors

    MinCut(IFlowOperators<W>)

    Declaration
    public MinCut(IFlowOperators<W> operator)
    Parameters
    Type Name Description
    IFlowOperators<W> operator

    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
    Type Description
    List<MinCutEdge<T>>
    Back to top Generated by DocFX