Struct MetricsGraph 

pub struct MetricsGraph { /* private fields */ }

A simple adjacency-list graph for metric computation.

Implementations

impl MetricsGraph

pub fn new_directed() -> Self

Create a new directed metrics graph.

pub fn new_undirected() -> Self

Create a new undirected metrics graph.

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

Add a node.

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

Add an edge between two nodes. In undirected mode, adds both directions.

pub fn node_count(&self) -> usize

Returns the number of nodes.

pub fn edge_count(&self) -> usize

Returns the number of edges.

pub fn diameter(&self) -> Option<usize>

Compute the graph diameter (longest shortest path between any two nodes). Returns None if the graph is empty or disconnected (between the connected components).

pub fn local_clustering_coefficient(&self, node: usize) -> f64

Compute the local clustering coefficient for a given node.

For an undirected graph: C(v) = 2 * edges_between_neighbors / (k * (k-1)) where k = degree of v.

pub fn average_clustering_coefficient(&self) -> f64

Compute the average clustering coefficient of the graph.

pub fn betweenness_centrality(&self) -> HashMap<usize, f64>

Approximate betweenness centrality using Brandes’ algorithm (exact for small graphs).

Returns a map of node_id -> centrality score (unnormalized).

Trait Implementations

impl Clone for MetricsGraph

fn clone(&self) -> MetricsGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MetricsGraph

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

Formats the value using the given formatter.