Struct CanonicalizeEdges 

pub struct CanonicalizeEdges { /* private fields */ }

Ordered sequence of directed edges for canonicalization.

Each edge is (from, to) where:

• from is the node being orthogonalized away from
• to is the direction towards the orthogonality center

Note on ordering

• For path-based canonicalization (moving ortho center), edges are connected: each edge’s to equals the next edge’s from.
• For full canonicalization (from scratch), edges represent parent edges in post-order DFS traversal, which may not be connected as a path but guarantees correct processing order (children before parents).

Example

For a chain A - B - C - D (canonizing towards D):

edges = [(A, B), (B, C), (C, D)]

For a star with center C (canonizing towards C):

    A
    |
B - C - D
    |
    E

edges = [(A, C), (B, C), (D, C), (E, C)]  (order depends on DFS)

Implementations

impl CanonicalizeEdges

pub fn empty() -> Self

Create an empty edge sequence (no-op canonicalization).

pub fn from_edges(edges: Vec<(NodeIndex, NodeIndex)>) -> Self

Create from a list of edges.

Note: For path-based canonicalization, edges should be connected (each edge’s to equals next edge’s from). For full canonicalization, edges may not be connected but must be in correct processing order.

pub fn is_empty(&self) -> bool

Check if empty (already at target, no work needed).

pub fn len(&self) -> usize

Number of edges to process.

pub fn iter(&self) -> impl Iterator<Item = &(NodeIndex, NodeIndex)>

Iterate over edges in order.

pub fn target(&self) -> Option<NodeIndex>

Get the final target node (orthogonality center).

Returns None if empty.

pub fn start(&self) -> Option<NodeIndex>

Get the starting node (first node to be factorized).

Returns None if empty.

Trait Implementations

impl Clone for CanonicalizeEdges

fn clone(&self) -> CanonicalizeEdges

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CanonicalizeEdges

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

Formats the value using the given formatter.

impl<'a> IntoIterator for &'a CanonicalizeEdges

type Item = &'a (NodeIndex, NodeIndex)

The type of the elements being iterated over.

type IntoIter = Iter<'a, (NodeIndex, NodeIndex)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for CanonicalizeEdges

type Item = (NodeIndex, NodeIndex)

The type of the elements being iterated over.

type IntoIter = IntoIter<<CanonicalizeEdges as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for CanonicalizeEdges

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

impl StructuralPartialEq for CanonicalizeEdges