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>
    Inherited Members
    Object.ToString()
    Object.Equals(Object)
    Object.Equals(Object, Object)
    Object.ReferenceEquals(Object, Object)
    Object.GetHashCode()
    Object.GetType()
    Object.MemberwiseClone()
    Namespace: Advanced.Algorithms.Graph
    Assembly: Advanced.Algorithms.dll
    Syntax
    public class MinCut<T, W>
        where W : IComparable
    Type Parameters
    Name Description
    T
    W

    Constructors

    MinCut(IFlowOperators<W>)

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

    Methods

    ComputeMinCut(WeightedDiGraph<T, W>, T, T)

    Declaration
    public List<MinCutEdge<T>> ComputeMinCut(WeightedDiGraph<T, W> graph, T source, T sink)
    Parameters
    Type Name Description
    WeightedDiGraph<T, W> graph
    T source
    T sink
    Returns
    Type Description
    List<MinCutEdge<T>>
    Back to top Generated by DocFX