Struct NetworkxBranchingPlan 

pub struct NetworkxBranchingPlan {
    pub initial: Vec<usize>,
    pub steps: Vec<(Vec<usize>, usize)>,
}

What networkx’s maximum_branching does to its final set of edge keys.

networkx builds the result by iterating a Python set of integer edge keys, so the result’s edge ORDER depends on that set’s history. The plan is that history: set(initial), then for each step update(circuit) and remove(removed). Replaying it on a Python set reproduces networkx’s order exactly; the keys index the input edge list.

Fields

initial: Vec<usize>

The last level’s branching keys, in networkx’s edge-index order.

steps: Vec<(Vec<usize>, usize)>

One step per contraction, from the last level to the first.

Trait Implementations

impl Clone for NetworkxBranchingPlan

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NetworkxBranchingPlan

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

Formats the value using the given formatter.

impl Eq for NetworkxBranchingPlan

impl PartialEq for NetworkxBranchingPlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for NetworkxBranchingPlan