Struct ApproximateGraphProcessor

pub struct ApproximateGraphProcessor { /* private fields */ }

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

Implementations

impl ApproximateGraphProcessor

pub fn new(config: ApproximateConfig) -> Self

Create new approximate graph processor

pub fn initialize( &mut self, processor: &IncrementalGraphProcessor, ) -> Result<()>

Initialize with graph data

pub fn update( &mut self, processor: &IncrementalGraphProcessor, ) -> Result<ApproximateMetrics>

Update with new graph changes

pub fn get_metrics(&self) -> ApproximateMetrics

Get current approximate metrics

pub fn is_node_active(&self, node_id: &str) -> bool

Check if a node is likely active

pub fn is_edge_recent(&self, source: &str, target: &str) -> bool

Check if an edge was recently added

pub fn estimate_node_degree(&self, node_id: &str) -> u32

Estimate node degree

pub fn estimate_edge_weight(&self, source: &str, target: &str) -> f64

Estimate edge weight

pub fn merge(&mut self, other: &ApproximateGraphProcessor) -> Result<()>

Merge with another approximate processor

pub fn add_triangle(&mut self, node_a: &str, node_b: &str, node_c: &str)

Add triangle for approximate triangle counting

pub fn reset(&mut self)

Reset all approximate structures

Trait Implementations

impl Debug for ApproximateGraphProcessor

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

Formats the value using the given formatter.