Struct PropagationTreeRouter 

pub struct PropagationTreeRouter { /* private fields */ }

Performs route resolving operations within a propagation tree.

The router parses the topology tree to generate a routing table, then provides next_hop() and dispatch() methods for directing messages to the correct gateway.

Load balancing is achieved by tracking the number of connections (fanin) per gateway node.

Implementations

impl PropagationTreeRouter

pub fn new( root: &str, topology: &TopologyTree, fanout: usize, ) -> Result<Self, RouteResolvingError>

Create a new router from a root node and topology tree.

The routing table is generated by traversing the tree from the root node’s position downward.

Errors

Returns RouteResolvingError::InvalidRoot if the root node cannot be found in the topology.

pub fn dispatch(&self, dst: &NodeSet) -> Vec<(NodeSet, NodeSet)>

Dispatch nodes from a target nodeset to directly connected gateways.

Acts as an iterator, yielding (gateway_nodeset, target_nodes) pairs. Provides load balancing between gateways. Remaining nodes that don’t match any route are treated as directly connected.

pub fn next_hop( &mut self, dst: &NodeSet, ) -> Result<NodeSet, RouteResolvingError>

Perform next-hop resolution for a single destination node.

Returns the best gateway to use based on current load (connections tracked in nodes_fanin).

pub fn mark_unreachable(&mut self, dst: &str)

Mark a node as unreachable.

pub fn root(&self) -> &str

Get the root node name.

pub fn fanout(&self) -> usize

Get the fanout setting.

pub fn table(&self) -> &[RouteEntry]

Get the routing table for inspection.

Trait Implementations

impl Debug for PropagationTreeRouter

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

Formats the value using the given formatter.