Struct GraphSummary 

pub struct GraphSummary {
    pub node_count: usize,
    pub edge_count: usize,
    pub entry_nodes: Vec<String>,
    pub terminal_nodes: Vec<String>,
}

A successful validation’s summary of the graph’s shape.

Entry nodes have no inbound edge; terminal nodes have no outbound edge. Both lists are sorted, so the CLI output is deterministic.

Fields

node_count: usize

Number of nodes in the document.

edge_count: usize

Number of edges in the document.

entry_nodes: Vec<String>

Ids of nodes with no inbound edge, sorted.

terminal_nodes: Vec<String>

Ids of nodes with no outbound edge, sorted.

Trait Implementations

impl Clone for GraphSummary

fn clone(&self) -> GraphSummary

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphSummary

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

Formats the value using the given formatter.

impl Eq for GraphSummary

impl PartialEq for GraphSummary

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphSummary