Struct StreamingTriangleCounter 

pub struct StreamingTriangleCounter { /* private fields */ }

Streaming triangle counter using a sliding adjacency window.

For each new edge (u, v) the algorithm counts common neighbours already present in the current window, giving an exact count for edges within the window and an approximate count when the stream overflows it.

For small graphs (total edges ≤ window_size) this is an exact counter.

References

Buriol et al., “Counting Triangles in Data Streams”, PODS 2006.

Implementations

impl StreamingTriangleCounter

pub fn new(config: StreamConfig) -> Self

Create a new counter with the given configuration.

pub fn process_edge(&mut self, u: usize, v: usize)

Process a single edge from the stream.

New triangles formed by (u, v) together with any common neighbour w already present in the adjacency sketch are counted. When the reservoir is full the oldest edge is evicted and removed from the sketch.

pub fn estimate_triangles(&self) -> f64

Return the current triangle estimate.

pub fn process_stream(&mut self, stream: &mut GraphStream) -> f64

Drive the counter over an entire GraphStream, returning the final estimate.

Trait Implementations

impl Debug for StreamingTriangleCounter

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

Formats the value using the given formatter.