Struct graphannis::graph::GraphStatistic

pub struct GraphStatistic {
    pub cyclic: bool,
    pub rooted_tree: bool,
    pub nodes: usize,
    pub avg_fan_out: f64,
    pub fan_out_99_percentile: usize,
    pub inverse_fan_out_99_percentile: usize,
    pub max_fan_out: usize,
    pub max_depth: usize,
    pub dfs_visit_ratio: f64,
}

Some general statistical numbers specific to a graph component

Fields

cyclic: bool

True if the component contains any cycle.

rooted_tree: bool

True if the component consists of a rooted trees.

nodes: usize

Number of nodes in this graph storage (both source and target nodes).

avg_fan_out: f64

Average fan out.

fan_out_99_percentile: usize

Max fan-out of 99% of the data.

inverse_fan_out_99_percentile: usize

Max inverse fan-out of 99% of the data.

max_fan_out: usize

Maximal number of children of a node.

max_depth: usize

Maximum length from a root node to a terminal node.

dfs_visit_ratio: f64

Only valid for acyclic graphs: the average number of times a DFS will visit each node.

Trait Implementations

impl Clone for GraphStatistic

fn clone(&self) -> GraphStatistic

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'de> Deserialize<'de> for GraphStatistic

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
    __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl MallocSizeOf for GraphStatistic

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.

impl Serialize for GraphStatistic

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where
    __S: Serializer,

Serialize this value into the given Serde serializer.