Struct TreeTopology 

pub struct TreeTopology<V, I> {
    pub nodes: HashMap<V, Vec<I>>,
    pub edges: Vec<(V, V)>,
}

Specification for tree topology: defines nodes and index ID assignments.

I is the index ID type (e.g., DynId). Each node maps to the IDs of its physical indices in the input tensor. This ensures correct index lookup regardless of tensor index ordering, which can change during factorization.

Fields

nodes: HashMap<V, Vec<I>>

Nodes in the tree (node name -> list of index IDs belonging to this node)

edges: Vec<(V, V)>

Edges in the tree: (node_a, node_b)

Implementations

impl<V: Clone + Hash + Eq, I: Clone + Eq> TreeTopology<V, I>

pub fn new(nodes: HashMap<V, Vec<I>>, edges: Vec<(V, V)>) -> Self

Create a new tree topology with the given nodes and edges.

Arguments

• nodes - Map from node name to the index IDs belonging to that node
• edges - List of edges as (node_a, node_b) pairs

pub fn validate(&self) -> Result<()>

Validate that this topology describes a tree.

Trait Implementations

impl<V: Clone, I: Clone> Clone for TreeTopology<V, I>

fn clone(&self) -> TreeTopology<V, I>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug, I: Debug> Debug for TreeTopology<V, I>

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

Formats the value using the given formatter.