Among all s-t maximum flows, finds one with minimum cost, assuming s != t and no negative-cost cycles. # Panics Panics if the flow or cost overflow a 64-bit signed integer.
(&self, s: usize, t: usize)
Source from the content-addressed store, hash-verified