Struct Graph 

pub struct Graph {
    pub nodes: Vec<Node>,
    pub edges: Vec<Edge>,
}

The complete ADR relationship graph.

Fields

nodes: Vec<Node>

All nodes (ADRs) in the graph.

edges: Vec<Edge>

All edges (relationships) between ADRs.

Implementations

impl Graph

pub fn new() -> Self

Creates a new empty graph.

pub fn from_adrs(adrs: &[Adr]) -> Self

Builds a graph from a collection of ADRs.

pub fn node_count(&self) -> usize

Returns the number of nodes in the graph.

pub fn edge_count(&self) -> usize

Returns the number of edges in the graph.

pub fn is_empty(&self) -> bool

Checks if the graph is empty (no nodes).

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Self

Returns the “default value” for a type.

impl Serialize for Graph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.