Struct horokai_network::Network

pub struct Network { /* fields omitted */ }

Definition of struct Network, the implementation of network in mathmatics.

Expression of network or graph is "The set of vertexes and the set of links which is pair of the vertex".
I use this index rule: the vertex is denoted by number 0 ~ n-1, n as the amount of the vertex.
So the expression of the struct Network becomes simple and smart.

Note : A famous way of the expression of network is adjacency matrix, but it use O(n^2) memory space.
I may prepare the access to the adjacency matrix bia function, but it is not inevitable.
Many of the calculation experiment program for the network dynamics like percolation is written with using edge list expression of the network, not adjacency matrix.
Adjacency matrix is used with the research of the behave of the eigenvalue, but I marely use it ( ; ; ).

Methods

impl Network

pub fn make_square_lattice(length: u32) -> Network

Create square lattice.

pub fn make_regular_lattice(dim: u32, length: u32) -> Network

Create regular lattice

pub fn make_regular_random_graph(n: u32, frac: f64, rng: &mut StdRng) -> Network

create regular random graph

pub fn exist_self_loop(&self) -> bool

Check of the self loop Calculation time is O(L).

pub fn exist_multi_loop(&self) -> bool

Check of the multi loop Caution : Calculation time is O(L^2), it can be vast time. Be careful.

pub fn show_network(&self)

impl Network

pub fn get_n(&self) -> u32

Get Network.n

pub fn get_edge_list(&self) -> Vec<(u32, u32)>

Get Network.edge_list

pub fn get_average_degree(&self) -> f64

Get average degree of the network Calculation time : O(1)

Trait Implementations

impl Clone for Network

fn clone(&self) -> Network

Returns a copy of the value.

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

Performs copy-assignment from source.