Package it.unimi.dsi.big.webgraph.algo
package it.unimi.dsi.big.webgraph.algo
Classes implementing useful algorithms on graphs.

ClassDescriptionComputes the connected components of a symmetric (a.k.a. undirected) graph using a parallel breadthfirst visit.A contentaddressable representation of the cumulative function of outdegrees that uses a strippeddown implementation of Elias–Fano's representation of monotone sequences partially taken from
EliasFanoMonotoneLongBigList
.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 breadthfirsts visits of a graph exploiting multicore parallelism.Computes the strongly connected components (and optionally the buckets) of an immutable graph.