mooncakes.io

README
U
DefaultId
U
Dsu
U
DynamicModInt
U
DynamicModulus
U
FenwickTree
U
FlowInt
U
LazySegTree
U
McfEdge
U
McfGraph
U
MfEdge
U
MfGraph
U
Mod1000000007
U
Mod998244353
U
ModInput
U
ModInt
U
ModInt1000000007
U
ModInt998244353
U
ModState
U
Modulus
U
SccGraph
U
SegTree
U
StaticModInt
U
TwoSat
U
Zero
V
convolution
V
convolution_ll
V
convolution_modint
V
crt
V
floor_sum
V
inv_mod
V
lcp_array
V
lcp_array_bytes
V
lcp_array_string
V
pow_mod
V
set_mod
V
suffix_array
V
suffix_array_bounded
V
suffix_array_bytes
V
suffix_array_string
V
z_algorithm
V
z_algorithm_bytes
V
z_algorithm_string

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

McfEdge

pub struct McfEdge[Cap, Cost] {
  from : Int
  to : Int
  cap : Cap
  flow : Cap
  cost : Cost
} derive(Eq, @moonbitlang/core/debug.Debug
Debug)

Immutable snapshot of an original edge.

McfGraph

source

pub struct McfGraph[_, _] {
  // private fields
} derive(@moonbitlang/core/debug.Debug
Debug)

Minimum-cost flow with nonnegative original costs. Capacity and cost can independently be Int or Int64.

McfGraph::add_edge

source

fn[C : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt, W : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt] McfGraph::add_edge(self : McfGraph[C, W], from : Int, to : Int, cap : C, cost : W) -> Int

McfGraph::edges

source

fn[C : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt, W : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt] McfGraph::edges(self : McfGraph[C, W]) -> Array[McfEdge[C, W]]

McfGraph::flow

source

fn[C : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt, W : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt] McfGraph::flow(self : McfGraph[C, W], s : Int, t : Int, flow_limit? : C) -> (C, W)

McfGraph::get_edge

source

fn[C : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt, W : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt] McfGraph::get_edge(self : McfGraph[C, W], i : Int) -> McfEdge[C, W]

McfGraph::new

source

fn[C, W] McfGraph::new(n : Int) -> McfGraph[C, W]

McfGraph::slope

source

fn[C : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt, W : @manabeai/ac-library-mbt/algebra.FlowInt
FlowInt] McfGraph::slope(self : McfGraph[C, W], s : Int, t : Int, flow_limit? : C) -> Array[(C, W)]

Piecewise-linear minimum cost curve, starting at (0,0), with collinear points merged. Call flow/slope at most once per graph. Total flow/cost must fit the chosen types.