Show / Hide Table of Contents

    Class EdmondKarpMaxFlow<T, W>

    An Edmond Karp max flow implementation on weighted directed graph using adjacency list representation of graph and residual graph.

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

    Constructors

    EdmondKarpMaxFlow(IFlowOperators<W>)

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

    Methods

    ComputeMaxFlow(IDiGraph<T>, T, T)

    Compute max flow by searching a path and then augmenting the residual graph until no more path exists in residual graph with possible flow.

    Declaration
    public W ComputeMaxFlow(IDiGraph<T> graph, T source, T sink)
    Parameters
    Type Name Description
    IDiGraph<T> graph
    T source
    T sink
    Returns
    Type Description
    W

    computeMaxFlowAndReturnResidualGraph(IDiGraph<T>, T, T)

    Compute max flow by searching a path and then augmenting the residual graph until no more path exists in residual graph with possible flow.

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