oxicuda-graphalg 0.3.0

OxiCUDA: Classical graph algorithms (BFS/DFS, shortest paths, MST, max-flow, matching, SCC, centrality, community, TSP, coloring, isomorphism)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

//! Streaming dynamic-graph algorithms.
//!
//! Algorithms that maintain a result under a *stream* of edge insertions and
//! deletions, recomputing only what each update can change instead of solving
//! from scratch every time.
//!
//! - [`dynamic_graph`] — [`DynamicGraph`], a mutable directed graph with a
//!   reverse index and edge-multiplicity tracking (the streaming substrate).
//! - [`incremental_pagerank`] — [`IncrementalPageRank`], warm-started power
//!   iteration that resumes from the previous stationary vector after each
//!   update, converging to the same ranks a cold solve would.
//! - [`incremental_scc`] — [`IncrementalScc`], strongly-connected-component
//!   maintenance that merges components on cycle-closing insertions and re-splits
//!   only the affected component on deletions.

pub mod dynamic_graph;
pub mod incremental_pagerank;
pub mod incremental_scc;

pub use dynamic_graph::DynamicGraph;
pub use incremental_pagerank::IncrementalPageRank;
pub use incremental_scc::IncrementalScc;