Expand description
Advanced streaming graph algorithms.
This module provides algorithms that process massive graphs edge-by-edge without requiring the full graph to reside in memory.
§Algorithms
| Algorithm | Description |
|---|---|
StreamingTriangleCounter | Reservoir + window exact/approximate triangle counting |
StreamingUnionFind | Online connected-components via path-compressed Union-Find |
streaming_bfs | Multi-pass BFS over an edge stream (memory-efficient) |
StreamingDegreeEstimator | Count-min sketch approximate degree queries |
Structs§
- Graph
Stream - An iterator-backed stream of graph edges
(u, v). - Stream
BfsResult - Result of a streaming BFS.
- Stream
Config - Configuration for streaming graph algorithms.
- Streaming
BfsConfig - Configuration for streaming BFS.
- Streaming
Degree Estimator - Streaming degree estimator backed by a count-min sketch.
- Streaming
Triangle Counter - Streaming triangle counter using a sliding adjacency window.
- Streaming
Union Find - Online connected-components via path-compressed, union-by-rank Union-Find.
Functions§
- streaming_
bfs - Memory-efficient multi-pass BFS over a
GraphStream.