Struct GraphInfo 

pub struct GraphInfo {
    pub node_count: usize,
    pub edge_count: usize,
    pub avg_degree: Precision,
    pub max_degree: usize,
    pub diameter: Option<usize>,
    pub is_strongly_connected: bool,
    pub scc_count: usize,
}

Graph connectivity information for push algorithms.

Fields

node_count: usize

Number of nodes in the graph

edge_count: usize

Number of edges in the graph

avg_degree: Precision

Average degree (edges per node)

max_degree: usize

Maximum degree in the graph

diameter: Option<usize>

Graph diameter (longest shortest path)

is_strongly_connected: bool

Whether the graph is strongly connected

scc_count: usize

Number of strongly connected components

Trait Implementations

impl Clone for GraphInfo

fn clone(&self) -> GraphInfo

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphInfo

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphInfo

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphInfo

fn eq(&self, other: &GraphInfo) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphInfo

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GraphInfo