1 unstable release
Uses new Rust 2024
| new 0.1.0 | Mar 15, 2025 |
|---|
#1006 in Algorithms
35KB
944 lines
A Graph Sparsifier
This is a graph sparsifier, which splits an undirected graph into high cohesion, low coupling components. It is based on an approximated PageRank algorithm introduced in
Detecting sharp drops in PageRank and a simplified local partitioning algorithm by Reid Andersen and Fan Chung
Dependencies
~3.5MB
~50K SLoC