Struct TreeEdge 

pub struct TreeEdge {
    pub source: usize,
    pub target: usize,
    pub capacity: f64,
}

Represents an edge in the Gomory-Hu tree.

Each edge connects two nodes from the original graph (or supernodes formed during construction) and stores a capacity, which corresponds to the min-cut value between those two nodes (or sets of nodes) in the original graph.

Fields

source: usize

One endpoint of the tree edge, representing a vertex from the original graph.

target: usize

The other endpoint of the tree edge, representing a vertex from the original graph.

capacity: f64

The capacity of this tree edge, equal to the min-cut value between source and target (or the components they represented) in the step it was added.

Implementations

impl TreeEdge

pub fn new(source: usize, target: usize, capacity: f64) -> Self

Creates a new TreeEdge.

Arguments

• source - The source vertex index.
• target - The target vertex index.
• capacity - The capacity of the edge, representing a min-cut value.

Trait Implementations

impl Clone for TreeEdge

fn clone(&self) -> TreeEdge

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeEdge

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

Formats the value using the given formatter.

impl PartialEq for TreeEdge

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