Skip to main content

Module dynamic

Module dynamic 

Source
Expand description

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_graphDynamicGraph, a mutable directed graph with a reverse index and edge-multiplicity tracking (the streaming substrate).
  • incremental_pagerankIncrementalPageRank, warm-started power iteration that resumes from the previous stationary vector after each update, converging to the same ranks a cold solve would.
  • incremental_sccIncrementalScc, strongly-connected-component maintenance that merges components on cycle-closing insertions and re-splits only the affected component on deletions.

Re-exports§

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

Modules§

dynamic_graph
A mutable directed graph supporting incremental edge insertion and deletion.
incremental_pagerank
Incremental PageRank over a streaming DynamicGraph.
incremental_scc
Incremental strongly-connected-component maintenance under edge updates.