pub fn min_cut(&self, dist: &[i64]) -> Vec<usize> {
        (0..self.graph.num_e())
            .filter(|&e| {
                let u = self.graph.endp[e ^ 1];
                let v = self.graph.endp[e];
                dist[u] < INF && dist[v] == INF
            })
            .collect()
    }
/// After running maximum flow, use this to recover the dual minimum cut.
After running maximum flow, use this to recover the dual minimum cut.
After running maximum flow use this to recover the dual minimum cut .
pub fn min_cut(&self, dist: &[i64]) -> Vec<usize> {
        (0..self.graph.num_e())
            .filter(|&e| {
                let u = self.graph.endp[e ^ 1];
                let v = self.graph.endp[e];
                dist[u] < INF && dist[v] == INF
            })
            .collect()
    }
pub fn min_cut ( & self , dist : & [ i64 ] ) -> Vec < usize > { ( 0 .. self . graph . num_e ( ) ) . filter ( | & e | { let u = self . graph . endp [ e ^ 1 ] ; let v = self . graph . endp [ e ] ; dist [ u ] < INF && dist [ v ] == INF } ) . collect ( ) }
After running maximum flow, use this to recover the dual minimum cut.
After running maximum flow use this to recover the dual minimum cut .
&self
dist
&[i64]
&self
dist
&[i64]