Module approximate 

Structs

ApproximateConfig

Configuration for approximate algorithms

ApproximateGraphProcessor

Approximate graph analytics processor Combines multiple approximate algorithms for scalable graph analysis

ApproximateMetrics

Approximate metrics computed by the processor

BloomFilter

Bloom Filter for approximate set membership testing Useful for checking if nodes/edges exist without storing the full set

CountMinSketch

Count-Min Sketch for approximate frequency counting Useful for tracking edge weights, node degrees, or other frequencies

HyperLogLog

Approximate algorithms for large-scale graph analytics These algorithms trade accuracy for performance and memory efficiency HyperLogLog implementation for approximate cardinality estimation Useful for counting unique nodes, edges, or other graph elements