Struct StreamingGraph 

pub struct StreamingGraph { /* private fields */ }

A streaming graph that supports incremental edge additions and deletions.

Maintains an adjacency set representation that is updated incrementally. Tracks basic statistics like degree distribution, edge count, and node count.

Implementations

impl StreamingGraph

pub fn new(directed: bool) -> Self

Create a new empty streaming graph.

pub fn process_event(&mut self, event: &StreamEvent)

Process a stream event (insert or delete an edge).

pub fn insert_edge(&mut self, src: usize, dst: usize, weight: f64)

Insert an edge into the graph.

pub fn delete_edge(&mut self, src: usize, dst: usize)

Delete an edge from the graph.

pub fn has_edge(&self, src: usize, dst: usize) -> bool

Check if an edge exists.

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

Get the degree of a node.

pub fn num_nodes(&self) -> usize

Get the number of nodes.

pub fn num_edges(&self) -> usize

Get the number of edges.

pub fn events_processed(&self) -> u64

Get the number of events processed.

pub fn neighbors(&self, node: usize) -> Vec<(usize, f64)>

Get neighbors of a node.

pub fn degree_distribution(&self) -> DegreeDistribution

Get the degree distribution as a histogram.

pub fn to_csr(&self) -> Result<CsrGraph>

Snapshot the current graph state as a CSR graph.

Trait Implementations

impl Debug for StreamingGraph

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

Formats the value using the given formatter.