Struct HrgTree 

pub struct HrgTree {
    pub left: Vec<i32>,
    pub right: Vec<i32>,
    pub prob: Vec<f64>,
    pub vertices: Vec<i32>,
    pub edges: Vec<i32>,
    /* private fields */
}

A hierarchical random graph represented as a binary dendrogram.

Internal vertices are identified by negative indices starting at -1 (the root). Leaf vertices use non-negative indices 0..n. Each internal vertex -(i+1) has its data at index i in the vectors.

Example

use rust_igraph::HrgTree;

let hrg = HrgTree::new(3);
assert_eq!(hrg.size(), 3);
assert_eq!(hrg.num_internal(), 2);

Fields

left: Vec<i32>

Left child of each internal vertex. Negative = internal, non-negative = leaf.

right: Vec<i32>

Right child of each internal vertex.

prob: Vec<f64>

Connection probability at each internal vertex.

vertices: Vec<i32>

Number of leaf vertices in the subtree of each internal vertex.

edges: Vec<i32>

Number of tree edges in the subtree below each internal vertex.

Implementations

impl HrgTree

pub fn new(n: u32) -> Self

Create a new HRG with n leaf vertices, all arrays zero-initialized.

pub fn size(&self) -> u32

The number of leaf vertices.

pub fn num_internal(&self) -> usize

The number of internal vertices (size - 1, or 0 for trivial trees).

pub fn resize(&mut self, new_size: u32)

Resize the HRG to hold new_size leaf vertices.

Trait Implementations

impl Clone for HrgTree

fn clone(&self) -> HrgTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HrgTree

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

Formats the value using the given formatter.