Struct RelationshipGraph 

pub struct RelationshipGraph {
    pub num_nodes: usize,
    pub max_weight: u64,
    pub registry: ResourceRegistry<EdgeKey, ()>,
}

A weighted directed graph whose only mutable edge owner is ResourceRegistry.

Fields

num_nodes: usize

Number of nodes in the fixed universe.

max_weight: u64

Inclusive edge-weight ceiling.

registry: ResourceRegistry<EdgeKey, ()>

Owner of exact weighted edges.

Implementations

impl RelationshipGraph

pub fn new(num_nodes: usize, max_weight: u64) -> RelationshipGraph

Construct an empty graph from an empty edge registry.

pub fn can_add_edge(&self, source: usize, target: usize, weight: u64) -> bool

Whether an exact weighted edge can be inserted.

pub fn contains_exact_edge( &self, source: usize, target: usize, weight: u64, ) -> bool

Query exact membership through the ResourceRegistry owner.

pub fn contains_pair(&self, source: usize, target: usize) -> bool

Scan the edge registry to answer the derived adjacency query.

pub fn add_edge(&mut self, source: usize, target: usize, weight: u64) -> bool

Register one exact weighted edge.

pub fn remove_edge(&mut self, source: usize, target: usize)

Remove every registered weight for one source/destination pair.