Struct GraphStats 

pub struct GraphStats {
    pub node_count: usize,
    pub edge_count: usize,
    pub density: f64,
    pub scc_count: usize,
    pub cycle_count: usize,
    pub weakly_connected_component_count: usize,
    pub isolated_node_count: usize,
    pub max_in_degree: usize,
    pub max_out_degree: usize,
    pub reduced_node_count: usize,
    pub reduced_edge_count: usize,
}

Summary statistics for a dependency graph.

Computed from a NormalizedGraph by GraphStats::from_normalized. All counts refer to the original (non-condensed) graph unless otherwise noted.

Fields

node_count: usize

Number of items (nodes) in the graph.

edge_count: usize

Number of blocking edges in the original graph.

density: f64

Graph density: edge_count / (node_count * (node_count - 1)). Ranges from 0.0 (no edges) to 1.0 (all possible edges present). Zero for graphs with 0 or 1 node.

scc_count: usize

Number of strongly connected components.

Equals node_count in a fully acyclic graph.

cycle_count: usize

Number of SCCs with more than one member (dependency cycles).

weakly_connected_component_count: usize

Number of weakly connected components (disjoint subgraphs).

isolated_node_count: usize

Number of nodes with no in-edges and no out-edges.

max_in_degree: usize

Maximum in-degree (most incoming blocking edges on one node).

max_out_degree: usize

Maximum out-degree (most outgoing blocking edges from one node).

reduced_node_count: usize

Number of nodes in the condensed (reduced) graph.

Equals scc_count — provided for convenience.

reduced_edge_count: usize

Number of edges in the transitively-reduced condensed graph.

Implementations

impl GraphStats

pub fn from_normalized(ng: &NormalizedGraph) -> Self

Compute statistics from a NormalizedGraph.

pub const fn is_flat(&self) -> bool

Return true if the graph has no blocking edges.

pub const fn has_cycles(&self) -> bool

Return true if the graph contains at least one dependency cycle.

pub fn reduction_ratio(&self) -> f64

Return the reduction ratio: how many edges were removed by transitive reduction vs the raw edge count.

Returns 0.0 if there are no edges in the original graph.

Trait Implementations

impl Clone for GraphStats

fn clone(&self) -> GraphStats

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphStats

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

Formats the value using the given formatter.

impl PartialEq for GraphStats

fn eq(&self, other: &GraphStats) -> 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 StructuralPartialEq for GraphStats