Struct SlidingWindowGraph 

pub struct SlidingWindowGraph { /* private fields */ }

A sliding window graph that maintains only the most recent W edges.

As new edges arrive, old edges beyond the window are automatically evicted. This is useful for maintaining a graph over a time-bounded stream.

Implementations

impl SlidingWindowGraph

pub fn new(window_size: usize, directed: bool) -> Self

Create a new sliding window graph.

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

Process a new edge. If the window is full, the oldest edge is evicted.

pub fn num_edges(&self) -> usize

Get the current number of edges in the window.

pub fn num_nodes(&self) -> usize

Get the current number of active nodes.

pub fn window_size(&self) -> usize

Get the window size.

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

Get neighbors of a node in the current window.

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

Get the degree of a node.

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

Check if an edge exists in the current window.

pub fn events_processed(&self) -> u64

Get total events processed.

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

Take a snapshot of the current window as a CSR graph.

Trait Implementations

impl Debug for SlidingWindowGraph

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

Formats the value using the given formatter.