Struct SwapSchedule 

pub struct SwapSchedule<V, Id>
where
    Id: Eq + Hash,
{
    pub root: V,
    pub steps: Vec<ScheduledSwapStep<V, Id>>,
}

Pre-computed swap schedule for swap_site_indices.

The schedule is derived purely from graph structure plus current and target site assignments. It contains no tensor data and can therefore be built, inspected, and unit-tested without performing any tensor contractions.

Related types:

• ScheduledSwapStep is one local two-site update in this schedule.
• SwapOptions affects execution of the schedule, but not its contents.

Examples

use std::collections::HashMap;

use tensor4all_treetn::{NodeNameNetwork, SwapSchedule};

let mut topology = NodeNameNetwork::new();
topology.add_node("A".to_string()).unwrap();
topology.add_node("B".to_string()).unwrap();
topology.add_edge(&"A".to_string(), &"B".to_string()).unwrap();

let current = HashMap::from([("s0".to_string(), "A".to_string())]);
let target = HashMap::from([("s0".to_string(), "B".to_string())]);
let root = "A".to_string();

let schedule = SwapSchedule::build(&topology, &current, &target, &root).unwrap();

assert_eq!(schedule.root, "A");
assert_eq!(schedule.steps.len(), 1);
assert_eq!(schedule.steps[0].node_a, "A");
assert_eq!(schedule.steps[0].node_b, "B");

Fields

root: V

Root used for the base Euler sweep and initial canonicalization.

steps: Vec<ScheduledSwapStep<V, Id>>

Fully expanded sequence of swap steps.

Implementations

impl<V, Id> SwapSchedule<V, Id>

where V: Clone + Hash + Eq + Debug + Send + Sync, Id: Clone + Hash + Eq + Debug,

pub fn build( topology: &NodeNameNetwork<V>, current_assignment: &HashMap<Id, V>, target_assignment: &HashMap<Id, V>, root: &V, ) -> Result<Self>

Build a swap schedule from topology plus current and target assignments.

The returned schedule is a pure graph computation. It simulates site positions through repeated Euler-tour sweeps, emits only edges where at least one targeted site index crosses, and records any required canonical-center transport between non-adjacent emitted swap steps.

Arguments

• topology - Tree topology whose nodes are named by V.
• current_assignment - Current node for every site index ID in the network.
• target_assignment - Partial target map; indices not listed keep their current side.
• root - Sweep root and assumed initial canonical center.

Returns

A SwapSchedule containing the ordered local updates needed to realize target_assignment.

Errors

Returns an error if root is missing, an index ID in target_assignment is unknown, a referenced node is missing from topology, no tree path exists between required nodes, or the simulated sweeps fail to satisfy the requested target assignment within the tree-diameter pass bound.

Trait Implementations

impl<V: Clone, Id> Clone for SwapSchedule<V, Id>

where Id: Eq + Hash + Clone,

fn clone(&self) -> SwapSchedule<V, Id>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug, Id> Debug for SwapSchedule<V, Id>

where Id: Eq + Hash + Debug,

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

Formats the value using the given formatter.