Struct GraphAnalyzer 

pub struct GraphAnalyzer { /* private fields */ }

Analyzes a directed acyclic graph represented as an adjacency list.

Nodes are represented by u64 IDs; edges as (from, to) pairs.

Implementations

impl GraphAnalyzer

pub fn new() -> Self

Creates an empty GraphAnalyzer.

pub fn add_node(&mut self, id: u64)

Adds a node with no edges (idempotent).

pub fn add_edge(&mut self, from: u64, to: u64)

Adds a directed edge from from to to, implicitly adding both nodes.

pub fn nodes(&self) -> HashSet<u64>

Returns the set of all unique node IDs.

pub fn edge_count(&self) -> usize

Returns the total number of directed edges.

pub fn analyze(&self) -> GraphStats

Computes and returns a GraphStats snapshot.

Trait Implementations

impl Clone for GraphAnalyzer

fn clone(&self) -> GraphAnalyzer

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphAnalyzer

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

Formats the value using the given formatter.

impl Default for GraphAnalyzer

fn default() -> GraphAnalyzer

Returns the “default value” for a type.