|
VeloGraphX
High-performance dynamic graph analytics in C++20
|
VeloGraphX is a high-performance C++20 and Python engine for dynamic graph analytics and incremental graph algorithms on large, continuously evolving graphs. It supports exact maintained BFS/unweighted SSSP, connected components, triangle counting and k-core; exact weighted shortest-path distances with conservative recomputation fallback; and PageRank-related maintenance with residual/tolerance validation.
The engine combines mutable graph storage with localized maintenance and full-recomputation paths. Its central systems question is practical: when should an evolving graph analytic be repaired incrementally, and when should the engine recompute the exact result?
These focused guides explain the major concepts and APIs while providing stable entry points for developers and researchers searching for dynamic and incremental graph analytics:
The public C++ API is generated from include/velographx/ with Doxygen. From a repository checkout:
The generated HTML entry point is:
The published site adds page-specific titles and descriptions, canonical URLs, Open Graph and Twitter metadata, a generated sitemap.xml, and a robots.txt file as part of the GitHub Pages build.
The Python package exposes the native engine through pybind11. Installation, local builds, interoperability with NumPy/SciPy/Arrow, and supported Python versions are documented in the Python bindings guide.
Install from PyPI with:
Publication-facing quantitative claims should be read together with their provenance and limitations. The authoritative claim mapping is maintained in PAPER.md, paper/results-ledger.md, and benchmarks/paper-evidence.json; historical workflow output is not automatically treated as current paper evidence.