Struct cnetworks::Network

pub struct Network { /* fields omitted */ }

Network is a graph-like data structure, containing a Vec of Node objects.

Implementations

impl Network

pub fn get_link(&self, i: usize, j: usize) -> Result<Option<f64>, String>

Gets the weight of the link between nodes i and j. Returns None if such link does not exist and Err if either i or j does not exist in the network.

pub fn link(&mut self, i: usize, j: usize) -> Result<(), String>

Establish a link between nodes i and j with current network’s weight. Returns Err if either i or j does not exist in the network. Does nothing if the requested link already exist.

This is a more user-friendly interface to the public-in-super _link.

pub fn link_exact(
    &mut self,
    i: usize,
    j: usize,
    w: f64
) -> Result<Option<f64>, String>

Establish a link between nodes i and j with sepcified weight. Updates the link weight and returns the old value if it already exist, None otherwise. Returns Err if either i or j does not exist in the network.

pub fn unlink(&mut self, i: usize, j: usize) -> Result<Option<f64>, String>

Unsafely remove a link between two nodes. Does not perform a check whether the integrity of the network is preserved.

Returns the weight of the removed connection or None if the connection does not exist and Err if either i or j does not exist in the network.

pub fn unlink_safe(&mut self, i: usize, j: usize) -> Result<Option<f64>, String>

Removes a link between two nodes ensuring the network does not split. Performs a BFS search to check whether the integrity of the network is preserved.

Returns the weight of removed link or None if the link does not exist or cannot be safely removed. Returns Err if either i or j does not exist in the network.

pub fn disconnect(&mut self, node: usize) -> Result<HashMap<usize, f64>, String>

Unsafely disconnect a node from the network by removing all of its links. Does not check if the network integrity is perserved. Returns the removed links as a HashMap of (target, weight) pairs. Returns Err if node does not exist in the network.

pub fn disconnect_safe(
    &mut self,
    node: usize
) -> Result<Option<HashMap<usize, f64>>, String>

Safely disconnect a node from the network by removing all of its links. Performs a bfs search to ensure that the other nodes can stil all reach each other, ie. the integrity of the network is perserved.

Returns removed links as HashMap of (target, weight) pairs or None if node cannot be safely disconnected. Returns Err if node does not exist in the network.

pub fn disconnect_all(&mut self)

Removes ALL links in the network and sets the model to NetworkModel::None such that the initial linking process can be conducted again, eg. using a different model in combination with Network::init_*.

impl Network

pub fn new(size: usize, model: NetworkModel, weight: LinkWeight) -> Self

Create a new network of given size and desired model. Use NetworkModel::None if you want a network with no connections.

Examples

Creating a network of chosen model and link weight:

let net = Network::new(20, NetworkModel::ER { p: 0.4, true }, LinkWeight::Uniform);
println!("{:?}", net);

Creating a network with no links and establishing them “by hand”:

let net = Network::new(10, NetworkModel::None, LinkWeight::Constant { c: 0.25 });
net.link(1, 2);
net.link(4, 7);
println!("{:?}", net);

pub fn init_er(net: &mut Network, p: f64, whole: bool)

Initialize (or reinitialize) the network’s links according to the Erdos-Renyi model. See the NetworkModel for more detailed model explanation.

If whole is true then the network is artificially stitched together after initialization, otherwise there is no guarantee that there are no ‘outsiders’ or even separate networks.

Beware that the network is not cleared before linking.

pub fn init_ba(net: &mut Network, m0: usize, m: usize)

Initialize (or reinitialize) the network’s links according to the Barabasi-Albert model. See the NetworkModel for more detailed model explanation.

The links are cleared before re-linking because of the nautre of initialization algorithm

pub fn edges(&self) -> usize

Return the total number of edges in the network.

pub fn avg_deg(&self) -> f64

Calculates the arithmetical average of vertex degrees (ie. number of closest neighbors) over the network.

pub fn deg_distr(&self) -> HashMap<usize, usize>

Returns the degree distribution of the network as a HashMap of histogram bins where key - degree, value - number of occurences in the network.

pub fn clear(&mut self)

Sets the infected on all nodes to false.

pub fn get_healthy(&self) -> HashSet<usize>

Returns a HashSet with indexes of healthy (not infected) nodes.

pub fn get_infected(&self) -> HashSet<usize>

Returns a HashSet with indexes of infected nodes.

Trait Implementations

impl Clone for Network

fn clone(&self) -> Network

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Network

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

Formats the value using the given formatter.