# 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