oxicuda_graphalg/dynamic/mod.rs
1//! Streaming dynamic-graph algorithms.
2//!
3//! Algorithms that maintain a result under a *stream* of edge insertions and
4//! deletions, recomputing only what each update can change instead of solving
5//! from scratch every time.
6//!
7//! - [`dynamic_graph`] — [`DynamicGraph`], a mutable directed graph with a
8//! reverse index and edge-multiplicity tracking (the streaming substrate).
9//! - [`incremental_pagerank`] — [`IncrementalPageRank`], warm-started power
10//! iteration that resumes from the previous stationary vector after each
11//! update, converging to the same ranks a cold solve would.
12//! - [`incremental_scc`] — [`IncrementalScc`], strongly-connected-component
13//! maintenance that merges components on cycle-closing insertions and re-splits
14//! only the affected component on deletions.
15
16pub mod dynamic_graph;
17pub mod incremental_pagerank;
18pub mod incremental_scc;
19
20pub use dynamic_graph::DynamicGraph;
21pub use incremental_pagerank::IncrementalPageRank;
22pub use incremental_scc::IncrementalScc;