Package it.unimi.dsi.webgraph.algo

Classes implementing useful algorithms on graphs.

See:
Description

Class Summary

ApproximateNeighbourhoodFunctions	Static methods and objects that manipulate approximate neighbourhood functions.
ConnectedComponents	Computes the conneted components of a symmetric (a.k.a. undirected) graph using a parallel breadth-first visit.
FourSweepIterativeFringeDiameter	Computes the diameter of a symmetric (a.k.a. undirected) graph.
HyperApproximateNeighbourhoodFunction	Computes the approximate neighbourhood function of a graph using HyperANF.
NeighbourhoodFunction	Computes the neighbourhood function of a graph by multiple parallel breadth-first visits.
ParallelBreadthFirstVisit	Performs breadth-firsts visits of a graph exploiting multicore parallelism.
SampleDistanceCumulativeDistributionFunction	Samples a graph via breadth-first visits.
StronglyConnectedComponents	Computes the strongly connected components (and optionally the buckets) of an immutable graph.

Package it.unimi.dsi.webgraph.algo Description

Classes implementing useful algorithms on graphs.