dkh.graph.mincostflow

Members

Functions

manyFlow void manyFlow(ref MinCostFlowInfo!(C, D, EPS, T) mcfInfo, C c): 流量がcになるまで流せるだけ流し続ける
minCostFlow MinCostFlowInfo!(C, D, EPS, T) minCostFlow(T g, int s, int t, bool neg = false): 最小費用流
singleFlow C singleFlow(ref MinCostFlowInfo!(C, D, EPS, T) mcfInfo, C c): min(nc, c)流す

Structs

MinCostFlowInfo struct MinCostFlowInfo(C, D, D EPS, T): 最小費用流の情報

Meta

Source

See Source File

dkh graph modules