Struct PrimalDualBuilder

Source

pub struct PrimalDualBuilder { /* private fields */ }

Implementations§

Source §

impl PrimalDualBuilder

Source

pub fn new(vsize: usize, esize_expect: usize) -> Self

Examples found in repository ?

crates/competitive/src/graph/minimum_cost_flow.rs (line 74)

73    pub fn builder(vsize: usize, esize_expect: usize) -> PrimalDualBuilder {
74        PrimalDualBuilder::new(vsize, esize_expect)
75    }

More examples

Hide additional examples

crates/aizu_online_judge/src/grl/grl_6_b.rs (line 10)

6pub fn grl_6_b(reader: impl Read, mut writer: impl Write) {
7    let s = read_all_unchecked(reader);
8    let mut scanner = Scanner::new(&s);
9    scan!(scanner, vs, es, f: u64, edges: [(usize, usize, u64, i64)]);
10    let mut builder = PrimalDualBuilder::new(vs, es);
11    builder.extend(edges.take(es));
12    let graph = builder.gen_graph();
13    let mut pd = builder.build(&graph);
14    let (flow, cost) = pd.minimum_cost_flow_limited(0, vs - 1, f);
15    writeln!(writer, "{}", if flow < f { -1 } else { cost }).ok();
16}

Source

pub fn add_edge(&mut self, from: usize, to: usize, cap: u64, cost: i64)

Examples found in repository ?

crates/competitive/src/graph/minimum_cost_flow.rs (line 56)

54    fn extend<T: IntoIterator<Item = (usize, usize, u64, i64)>>(&mut self, iter: T) {
55        for (from, to, cap, cost) in iter {
56            self.add_edge(from, to, cap, cost)
57        }
58    }

Source

pub fn gen_graph(&mut self) -> BidirectionalSparseGraph

Examples found in repository ?

crates/aizu_online_judge/src/grl/grl_6_b.rs (line 12)

6pub fn grl_6_b(reader: impl Read, mut writer: impl Write) {
7    let s = read_all_unchecked(reader);
8    let mut scanner = Scanner::new(&s);
9    scan!(scanner, vs, es, f: u64, edges: [(usize, usize, u64, i64)]);
10    let mut builder = PrimalDualBuilder::new(vs, es);
11    builder.extend(edges.take(es));
12    let graph = builder.gen_graph();
13    let mut pd = builder.build(&graph);
14    let (flow, cost) = pd.minimum_cost_flow_limited(0, vs - 1, f);
15    writeln!(writer, "{}", if flow < f { -1 } else { cost }).ok();
16}

Source

pub fn build(self, graph: &BidirectionalSparseGraph) -> PrimalDual<'_>

Examples found in repository ?

crates/aizu_online_judge/src/grl/grl_6_b.rs (line 13)

6pub fn grl_6_b(reader: impl Read, mut writer: impl Write) {
7    let s = read_all_unchecked(reader);
8    let mut scanner = Scanner::new(&s);
9    scan!(scanner, vs, es, f: u64, edges: [(usize, usize, u64, i64)]);
10    let mut builder = PrimalDualBuilder::new(vs, es);
11    builder.extend(edges.take(es));
12    let graph = builder.gen_graph();
13    let mut pd = builder.build(&graph);
14    let (flow, cost) = pd.minimum_cost_flow_limited(0, vs - 1, f);
15    writeln!(writer, "{}", if flow < f { -1 } else { cost }).ok();
16}