Struct NodeGraph

pub struct NodeGraph {
    nodes: BTreeMap<NodeId, InterconnectNode>,
}

Fields

nodes: BTreeMap<NodeId, InterconnectNode>

Flattened graph. Each node maintains a list of incoming edges from other nodes.

Implementations

impl NodeGraph

pub fn new(nodes: Vec<Node>, edges: Vec<Edge>) -> Result<Self, Status>

pub fn update_path( &mut self, path: &Path, average_bandwidth_bps: u64, peak_bandwidth_bps: u64, )

Sets the edge from |dst_node_id| to |src_node_id| to the provided bandwidth values.

pub fn make_bandwidth_requests(&self, path: &Path) -> Vec<NodeBandwidth>

Creates a bandwidth request for the specified path where the bandwidth request includes an entry for each path that intersects with this node.

pub fn make_path( &mut self, path_id: PathId, path_name: impl Into<String>, src_node_id: NodeId, dst_node_id: NodeId, ) -> Result<Path, Status>

Returns a path that includes provides a path between src and dst.

Trait Implementations

impl Debug for NodeGraph

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

Formats the value using the given formatter.

impl PartialEq for NodeGraph

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

impl StructuralPartialEq for NodeGraph