Struct GraphAnalysis 

pub struct GraphAnalysis {
    pub node_count: usize,
    pub edge_count: usize,
    pub has_cycle: bool,
    pub depth: usize,
    pub unreachable: Vec<String>,
}

Output of CompiledGraph::analyze.

Fields

node_count: usize

Number of registered nodes (excludes the synthetic __END__).

edge_count: usize

Number of static edges declared on the graph.

has_cycle: bool

true if the static edge graph contains a cycle reachable from the start node.

depth: usize

Longest path from the start node to any reachable node, measured in edges. 0 if the graph contains a cycle (depth is undefined for non-DAGs) or has no start node.

unreachable: Vec<String>

Nodes registered on the graph but not reachable from the start via static edges. Sorted alphabetically.

Trait Implementations

impl Clone for GraphAnalysis

fn clone(&self) -> GraphAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphAnalysis

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

Formats the value using the given formatter.

impl PartialEq for GraphAnalysis

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

impl StructuralPartialEq for GraphAnalysis