See: Description
Class  Description 

BreadthFirst 
The main method of this class loads an arbitrary
ImmutableGraph
and performs a breadthfirst visit of the graph (optionally starting just from a given node, if provided,
in which case it prints the eccentricity of the node, i.e., the maximum distance from the node). 
ErdosRenyiGraph 
An Erdős–Rényi random graph: the number of nodes
is fixed, and there is a fixed probability that an arc is put
between any two nodes (independently for every pair).

IntegerListImmutableGraph 
Exposes a graph in a simple binary format as an (offlineonly)
ImmutableGraph . 
IntegerTriplesArcLabelledImmutableGraph 
A class exposing a list of triples as an
ArcLabelledImmutableGraph . 
OutdegreeStats 
The main method of this class loads an arbitrary
ImmutableGraph
and performs a sequential scan to establish the minimum, maximum and average outdegree. 
Example classes that do nice things using the WebGraph framework.