Struct igraph_bliss_info_t 

#[repr(C)]
pub struct igraph_bliss_info_t {
    pub nof_nodes: c_ulong,
    pub nof_leaf_nodes: c_ulong,
    pub nof_bad_nodes: c_ulong,
    pub nof_canupdates: c_ulong,
    pub nof_generators: c_ulong,
    pub max_level: c_ulong,
    pub group_size: *mut c_char,
}

\struct igraph_bliss_info_t \brief Information about a Bliss run.

Some secondary information found by the Bliss algorithm is stored here. It is useful if you wany to study the internal working of the algorithm.

\member nof_nodes The number of nodes in the search tree. \member nof_leaf_nodes The number of leaf nodes in the search tree. \member nof_bad_nodes Number of bad nodes. \member nof_canupdates Number of canrep updates. \member nof_generators Number of generators of the automorphism group. \member max_level Maximum level. \member group_size The size of the automorphism group of the graph, given as a string. It should be deallocated via \ref igraph_free() if not needed any more.

See https://users.aalto.fi/~tjunttil/bliss/ for details about the algorithm and these parameters.

Fields

nof_nodes: c_ulong

nof_leaf_nodes: c_ulong

nof_bad_nodes: c_ulong

nof_canupdates: c_ulong

nof_generators: c_ulong

max_level: c_ulong

group_size: *mut c_char

Trait Implementations

impl Clone for igraph_bliss_info_t

fn clone(&self) -> igraph_bliss_info_t

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for igraph_bliss_info_t

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

Formats the value using the given formatter.

impl Copy for igraph_bliss_info_t