Computes the connected components of a symmetric (a.k.a. undirected) graph using a parallel breadth-first visit.
A content-addressable representation of the cumulative function of outdegrees that uses a stripped-down implementation of Elias–Fano's representation of monotone sequences partially taken from
Computes an approximation of the neighbourhood function, of the size of the reachable sets, and of (discounted) positive geometric centralities of a graph using HyperBall.
Performs breadth-firsts visits of a graph exploiting multicore parallelism.
Computes the strongly connected components (and optionally the buckets) of an immutable graph.
Classes implementing useful algorithms on graphs.