🥮 mooncakes.io

    manabeai/ac-library-mbt/maxflow does not have a README file

    MfEdge

    source
    pub struct MfEdge[Cap] {
      from : Int
      to : Int
      cap : Cap
      flow : Cap
    } derive(Eq, 
    Debug    )

    Immutable snapshot of an original edge.

    MfGraph

    source
    pub struct MfGraph[_] {
      // private fields
    } derive(
    Debug    )

    Dinic's maximum-flow graph with Int or Int64 capacities.

    MfGraph::add_edge

    source
    fn[C : 
    FlowInt    ] MfGraph::add_edge(self : MfGraph[C], from : Int, to : Int, cap : C) -> Int

    MfGraph::change_edge

    source
    fn[C : 
    FlowInt    ] MfGraph::change_edge(self : MfGraph[C], i : Int, new_cap : C, new_flow : C) -> Unit

    MfGraph::edges

    source

    MfGraph::flow

    source
    fn[C : 
    FlowInt    ] MfGraph::flow(self : MfGraph[C], s : Int, t : Int, flow_limit? : C) -> C

    Adds up to flow_limit units of flow. May be called repeatedly on the residual graph.

    MfGraph::get_edge

    source
    fn[C : 
    FlowInt    ] MfGraph::get_edge(self : MfGraph[C], i : Int) -> MfEdge[C]

    MfGraph::min_cut

    source
    fn[C] MfGraph::min_cut(self : MfGraph[C], s : Int) -> Array[Bool]

    Vertices reachable from s in the current residual graph. O(n+m).

    MfGraph::new

    source
    fn[C] MfGraph::new(n : Int) -> MfGraph[C]

    Source Files

    Powered by MoonBit

    Site sourceReport issuePackagesBuild queueSkillsStatistics

    © 2026 mooncakes.io