Struct GomoryHuTree 

pub struct GomoryHuTree {
    pub tree: Graph,
    pub flows: Vec<f64>,
}

A Gomory–Hu tree, see Graph::gomory_hu_tree.

Fields

tree: Graph

The tree: an undirected graph on the same vertices as the input graph, with n - 1 edges (edge i - 1 joins vertex i to its tree parent).

flows: Vec<f64>

The flow value annotating each tree edge, indexed by tree edge id.

Implementations

impl GomoryHuTree

pub fn flow_between(&self, u: VertexId, v: VertexId) -> Option<f64>

The maximum flow (equivalently, minimum cut) value between u and v in the original graph, read off the tree as the minimum edge annotation along the tree path from u to v.

Returns None when u == v or when either id is out of range.

Trait Implementations

impl Clone for GomoryHuTree

fn clone(&self) -> GomoryHuTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GomoryHuTree

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

Formats the value using the given formatter.

impl PartialEq for GomoryHuTree

fn eq(&self, other: &GomoryHuTree) -> 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 GomoryHuTree