WebGraph is a framework for studying web graphs.
It provides simple methods for managing very large
graphs by exploiting modern compression
techniques.
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.
This release is part of a parallel release of fastutil, the DSI Utilities, Sux4J, MG4J, WebGraph, etc. that prepare the way for "big" versions, that is, supporting >2^31 entries in arrays (simulated), elements in lists, terms, documents, nodes, etc. Batches of offline methods are now compressed. Several improvements to the HyperANF algorithm.
This release contains an implementation of HyperANF, a new highly scalable algorithm for computing the neighborhood function of a graph, and methods that compute the average shortest path and other derived data from the neighborhood function. Moreover, a wealth of statistical data is now computed during compression.
