pub fn add_edge(&mut self, u: usize, v: usize, cap: i64, cost: i64) {
        self.cap.push(cap);
        self.cap.push(0);
        self.cost.push(cost);
        self.cost.push(-cost);
        self.graph.add_undirected_edge(u, v);
    }
/// Adds an edge with specified capacity and cost. The reverse edge is also
/// added for residual graph computation, but has zero capacity.
Adds an edge with specified capacity and cost. The reverse edge is also
added for residual graph computation, but has zero capacity.
Adds an edge with specified capacity and cost . The reverse edge is also added for residual graph computation but has zero capacity .
pub fn add_edge(&mut self, u: usize, v: usize, cap: i64, cost: i64) {
        self.cap.push(cap);
        self.cap.push(0);
        self.cost.push(cost);
        self.cost.push(-cost);
        self.graph.add_undirected_edge(u, v);
    }
pub fn add_edge ( & mut self , u : usize , v : usize , cap : i64 , cost : i64 ) { self . cap . push ( cap ) ; self . cap . push ( 0 ) ; self . cost . push ( cost ) ; self . cost . push ( - cost ) ; self . graph . add_undirected_edge ( u , v ) ; }
Adds an edge with specified capacity and cost.
Adds an edge with specified capacity and cost .
&mut self
u
usize
v
usize
cap
i64
cost
i64
&mut self
u
usize
v
usize
cap
i64
cost
i64