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. |
| AbstractLazyIntIterator |
An abstract implementation of a lazy integer iterator, implementing
AbstractLazyIntIterator.skip(int)
by repeated calls to nextInt(). |
| ApproximateNeighbourhoodFunctions |
Static methods and objects that manipulate approximate neighbourhood functions.
|
| 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.
|
| ArrayListMutableGraph |
A very simple mutable graph class based on
IntArrayLists. |
| 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. |
| BetweennessCentrality |
Computes the betweenness centrality using an implementation of Brandes's algorithm
(Ulrik Brandes, “A Faster Algorithm for Betweenness Centrality”, Journal of
Mathematical Sociology 25(2):163−177, 2001)
that uses multiple parallel breadth-first visits.
|
| BetweennessCentrality.PathCountOverflowException |
An exception telling that the path count exceeded 64-bit integer arithmetic.
|
| BitStreamArcLabelledImmutableGraph |
A labelled graph storing its labels as a bit stream.
|
| BitStreamArcLabelledImmutableGraph.BitStreamLabelledArcIterator | |
| BreadthFirst |
The main method of this class loads an arbitrary
ImmutableGraph
and performs a breadth-first 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). |
| 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.
|
| Check |
Static methods that check properties of immutable graphs.
|
| 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.
|
| DegreeRangeImmutableSubgraph |
A subclass of
ImmutableSubgraph exposing the subgraph formed by nodes whose outdegree is in a given range. |
| 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. |
| 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).
|
| FixedWidthIntLabel |
An integer represented in fixed width.
|
| FixedWidthIntListLabel |
A list of integers represented in fixed width.
|
| FourSweepIterativeFringeDiameter | Deprecated. |
| GammaCodedIntLabel |
A natural number represented in γ coding.
|
| GeometricCentralities |
Computes exactly a set of positive geometric centralitites (more precisely, closeness, Lin's, harmonic and exponential centrality)
and the number of reachable nodes using multiple parallel breadth-first visits.
|
| 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.
|
| HyperBall.AbstractDiscountFunction |
An abstract discount function is a facility to implement a discount function (so that only
the
Int2DoubleFunction.get(int) method must be actually implemented). |
| 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 |
An adapter exposing an
ImmutableGraph that can be filled incrementally using
a family of addition methods that make it possible to specify
the list of successors of each node in increasing order. |
| IntegerLabelFilter |
A filter for labelled graphs preserving those arcs whose integer labels are in a specified set.
|
| 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. |
| IntIntervalSequenceIterator |
An iterator returning the integers contained in a sequence of intervals.
|
| JungAdapter | |
| 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.
|
| LazyIntSkippableIterator |
A skippable lazy iterator over the integers.
|
| MaskedIntIterator |
An iterator returning the element of an underlying iterator but filters
them using a inclusion-exclusion block list.
|
| MergedIntIterator |
An iterator returning the union of the integers returned by two
IntIterators. |
| NeighbourhoodFunction |
Computes the neighbourhood function of a graph by multiple parallel breadth-first visits.
|
| NodeIterator |
This interface extends
IntIterator 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.
|
| SampleDistanceCumulativeDistributionFunction |
Samples a graph via breadth-first visits.
|
| 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.
|
| SumSweepDirectedDiameterRadius |
Computes the radius and/or the diameter and/or all eccentricities of a graph,
using the SumSweep algorithm described by Michele Borassi, Pierluigi
Crescenzi, Michel Habib, Walter A.
|
| SumSweepDirectedDiameterRadius.OutputLevel |
The type of output requested: radius, diameter, radius and diameter, all
forward eccentricities, or all (forward and backward) eccentricities.
|
| SumSweepUndirectedDiameterRadius |
Computes the radius and/or the diameter and/or all eccentricities of an
undirected graph, using the SumSweep algorithm described by Michele Borassi,
Pierluigi Crescenzi, Michel Habib, Walter A.
|
| SumSweepUndirectedDiameterRadius.OutputLevel |
The type of output requested: radius, diameter, radius and diameter, or
all eccentricities.
|
| TopKGeometricCentrality |
Computes the k most central vertices according to a positive geometric centrality.
|
| TopKGeometricCentrality.Centrality |
The centralities with respect to which it is possible to find the top k nodes.
|
| 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.
|
SumSweepDirectedDiameterRadius/SumSweepUndirectedDiameterRadius.