Struct GraphChangeDetector 

pub struct GraphChangeDetector { /* private fields */ }

Graph change detection algorithms for anomaly detection and community drift These algorithms monitor graph evolution and detect significant structural changes

Implementations

impl GraphChangeDetector

pub fn new(max_history: usize, change_sensitivity: f64) -> Self

pub fn default() -> Self

Default change detector

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

Initialize the detector with current graph state

pub fn update( &mut self, processor: &IncrementalGraphProcessor, changes: &UpdateResult, ) -> Result<Vec<AnomalyEvent>>

Update detector with new graph changes

pub fn recent_anomalies(&self, count: usize) -> Vec<&AnomalyEvent>

Get recent anomalies

pub fn significant_changes(&self) -> &[GraphChange]

Get significant changes

pub fn is_anomalous_state(&self) -> bool

Check if the graph is in an anomalous state

pub fn current_community_stability(&self) -> Option<f64>

Get current community stability

Trait Implementations

impl Clone for GraphChangeDetector

fn clone(&self) -> GraphChangeDetector

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphChangeDetector

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

Formats the value using the given formatter.