Struct igraph_hrg_t 

#[repr(C)]
pub struct igraph_hrg_t {
    pub left: igraph_vector_int_t,
    pub right: igraph_vector_int_t,
    pub prob: igraph_vector_t,
    pub vertices: igraph_vector_int_t,
    pub edges: igraph_vector_int_t,
}

\struct igraph_hrg_t \brief Data structure to store a hierarchical random graph.

A hierarchical random graph (HRG) can be given as a binary tree, where the internal vertices are labeled with real numbers.

Note that you don’t necessarily have to know this internal representation for using the HRG functions, just pass the HRG objects created by one igraph function, to another igraph function.

It has the following members:

\member left Vector that contains the left children of the internal tree vertices. The first vertex is always the root vertex, so the first element of the vector is the left child of the root vertex. Internal vertices are denoted with negative numbers, starting from -1 and going down, i.e. the root vertex is -1. Leaf vertices are denoted by non-negative number, starting from zero and up. \member right Vector that contains the right children of the vertices, with the same encoding as the \c left vector. \member prob The connection probabilities attached to the internal vertices, the first number belongs to the root vertex (i.e. internal vertex -1), the second to internal vertex -2, etc. \member edges The number of edges in the subtree below the given internal vertex. \member vertices The number of vertices in the subtree below the given internal vertex, including itself.

Fields

left: igraph_vector_int_t

right: igraph_vector_int_t

prob: igraph_vector_t

vertices: igraph_vector_int_t

edges: igraph_vector_int_t

Trait Implementations

impl Clone for igraph_hrg_t

fn clone(&self) -> igraph_hrg_t

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for igraph_hrg_t

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

Formats the value using the given formatter.