Struct MaxFlow 

pub struct MaxFlow {
    pub value: f64,
    pub flow: Vec<f64>,
    pub cut: Vec<EdgeId>,
    pub partition: Vec<VertexId>,
    pub partition2: Vec<VertexId>,
    pub stats: MaxflowStats,
}

A maximum flow between two vertices, as computed by Graph::maxflow.

Fields

value: f64

The value of the maximum flow, i.e. the net amount entering the target.

flow: Vec<f64>

The flow on each edge, indexed by edge id.

In undirected graphs the sign encodes the direction: a positive value means the flow goes from the smaller vertex id to the larger one, a negative value the other way round.

cut: Vec<EdgeId>

Ids of the edges of the minimum cut corresponding to this flow; their capacities sum up to value.

partition: Vec<VertexId>

The side of the minimum cut containing the source.

partition2: Vec<VertexId>

The side of the minimum cut containing the target.

stats: MaxflowStats

Operation counts of the push-relabel solver.

Trait Implementations

impl Clone for MaxFlow

fn clone(&self) -> MaxFlow

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MaxFlow

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for MaxFlow

fn eq(&self, other: &MaxFlow) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for MaxFlow