All Classes

Class Description
AbstractIntLabel
An abstract (single-attribute) integer label.
AbstractIntListLabel
An abstract (single-attribute) list-of-integers label.
AbstractLabel
An abstract implementation throwing an IllegalArgumentException on all primitive-type methods.
AbstractLazyLongIterator
An abstract implementation of a lazy integer iterator, implementing AbstractLazyLongIterator.skip(long) by repeated calls to nextInt().
ArcLabelledImmutableGraph
An abstract implementation of a graph labelled on its arcs.
ArcLabelledImmutableSequentialGraph
An abstract arc-labelled immutable graph that throws an UnsupportedOperationException on all random-access methods.
ArcLabelledNodeIterator
An iterator returning nodes, their successors and labels on the arcs.
ArcLabelledNodeIterator.LabelledArcIterator
An iterator returning successor and the labels of the arcs toward them.
ArcListASCIIGraph
An ImmutableGraph that corresponds to graphs stored in a human-readable ASCII format were each line contains an arc.
ArcRelabelledImmutableGraph
Exhibits an arc-labelled immutable graph as another arc-labelled immutable graph changing only the kind of labels.
ArcRelabelledImmutableGraph.LabelConversionStrategy
A way to convert a label into another label.
ASCIIGraph
An ImmutableGraph that corresponds to graphs stored in a human-readable ASCII format where each line contains the list of successors of a given node.
BitStreamArcLabelledImmutableGraph
A labelled graph storing its labels as a bit stream.
BitStreamArcLabelledImmutableGraph.BitStreamLabelledArcIterator  
BuildHostMap
A class computing host-related data given a list of URLs (usually, the URLs of the nodes of a web graph).
BVGraph
An immutable graph represented using the techniques described in “The WebGraph Framework I: Compression Techniques”, by Paolo Boldi and Sebastiano Vigna, in Proc. of the Thirteenth World–Wide Web Conference, pages 595−601, 2004, ACM Press.
CompressionFlags
This interface provides constants to be used as compression flags.
ConnectedComponents
Computes the connected components of a symmetric (a.k.a. undirected) graph using a parallel breadth-first visit.
EFGraph
An immutable graph based on the Elias–Fano representation of monotone sequences.
EFGraph.Accumulator  
EFGraph.EliasFanoSuccessorReader  
EFGraph.LongWordBitReader  
EFGraph.LongWordCache  
EFGraph.LongWordOutputBitStream  
EliasFanoCumulativeOutdegreeList
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 EliasFanoMonotoneLongBigList.
FixedWidthIntLabel
An integer represented in fixed width.
FixedWidthIntListLabel
A list of integers represented in fixed width.
GammaCodedIntLabel
A natural number represented in γ coding.
GraphClassParser
A small wrapper around JSAP's standard ClassStringParser.
HyperBall
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.
ImmutableGraph
A simple abstract class representing an immutable graph.
ImmutableGraph.LoadMethod
A list of the methods that can be used to load a graph.
ImmutableSequentialGraph
An abstract immutable graph that throws an UnsupportedOperationException on all random-access methods.
ImmutableSubgraph
An induced subgraph of a given immutable graph.
IncrementalImmutableSequentialGraph  
IntegerLabelFilter  
IntegerListImmutableGraph
Exposes a graph in a simple binary format as an (offline-only) ImmutableGraph.
IntegerTriplesArcLabelledImmutableGraph
A class exposing a list of triples as an ArcLabelledImmutableGraph.
Label
A set of attributes that can be used to decorate a node or an arc of a graph.
LabelMergeStrategy
A way to merge two labels into one; the actual merge is performed by the LabelMergeStrategy.merge(Label, Label) method.
Labels  
LabelSemiring
A semiring used to compose labels.
LazyIntIterator
A lazy iterator over the integers.
LazyIntIterators
A class providing static methods and objects that do useful things with lazy integer iterators.
LazyLongIterator
A lazy iterator over longs.
LazyLongIterators
A class providing static methods and objects that do useful things with lazy integer iterators.
LazyLongSkippableIterator
LongIntervalSequenceIterator
An iterator returning the integers contained in a sequence of intervals.
MaskedLongIterator
An iterator returning the element of an underlying iterator but filters them using a inclusion-exclusion block list.
MergedLongIterator
An iterator returning the union of the integers returned by two IntIterators.
NodeIterator
This interface extends LongIterator and is used to scan a graph, that is, to read its nodes and their successor lists sequentially.
OutdegreeStats
The main method of this class loads an arbitrary ImmutableGraph and performs a sequential scan to establish the minimum, maximum and average outdegree.
ParallelBreadthFirstVisit
Performs breadth-firsts visits of a graph exploiting multicore parallelism.
ScatteredArcsASCIIGraph
An ImmutableGraph that corresponds to a graph stored as a scattered list of arcs.
ShiftedByOneArcListASCIIGraph
An ArcListASCIIGraph with fixed shift -1.
SpeedTest  
Stats
Computes basic statistical data about a given graph.
StronglyConnectedComponents
Computes the strongly connected components (and optionally the buckets) of an immutable graph.
Transform
Static methods that manipulate immutable graphs.
Transform.ArcFilter
Provides a method to accept or reject an arc.
Transform.BatchGraph  
Transform.LabelledArcFilter
Provides a method to accept or reject a labelled arc.
Transform.LowerBound
An arc filter that rejects arcs whose well-known attribute has a value smaller than a given threshold.
Transform.NodeClassFilter
An arc filter that only accepts arcs whose endpoints belong to the same (if the parameter keepOnlySame is true) or to different (if keepOnlySame is false) classes.
UnionArcLabelledImmutableGraph
An arc-labelled immutable graph representing the union of two given such graphs.
UnionImmutableGraph
An immutable graph representing the union of two given graphs.