All Classes and Interfaces
Class
Description
An abstract (single-attribute) integer label.
An abstract (single-attribute) list-of-integers label.
An abstract implementation throwing an
IllegalArgumentException on all primitive-type methods.An abstract implementation of a lazy integer iterator, implementing
AbstractLazyIntIterator.skip(int)
by repeated calls to nextInt().Outputs (onto stdout) an EPS image showing a sketch of the graph adjacency matrix.
Outputs (onto stdout) the graph adjacency matrix in SMAT format.
Static methods and objects that manipulate approximate neighbourhood functions.
An abstract implementation of a graph labelled on its arcs.
An abstract arc-labelled immutable graph that throws an
UnsupportedOperationException
on all random-access methods.An iterator returning nodes, their successors and labels on the arcs.
An iterator returning successor and the labels of the arcs toward them.
An
ImmutableGraph that corresponds to graphs stored in a human-readable
ASCII format were each line contains an arc.Exhibits an arc-labelled immutable graph as another arc-labelled immutable graph changing only
the kind of labels.
A way to convert a label into another label.
A very simple mutable graph class based on
IntArrayLists.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.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.
An exception telling that the path count exceeded 64-bit integer arithmetic.
A labelled graph storing its labels as a bit stream.
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).Reads a list of URLs from standard input and writes to standard output a host map
in
DataOutput format.A class computing host-related data given a list of URLs (usually, the URLs of the nodes of a web graph).
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.
Static methods that check properties of immutable graphs.
This interface provides constants to be used as compression flags.
Computes the connected components of a symmetric (a.k.a. undirected) graph
using a parallel breadth-first visit.
Converts from textual to binary representation a web graph.
Exposes a COSIN graph as an (offline-only) immutable graph.
This class provides 64-bit CRCs for strings and byte arrays.
A subclass of
ImmutableSubgraph exposing the subgraph formed by nodes whose outdegree is in a given range.This class represents a dynamic DAG (nodes and arcs can be added but not deleted), keeping
at the same time a topological order of its nodes, as described in:
Haeupler, Bernhard, et al.
The type of a DAG node.
This class implements a simplified one-level version of the data structure described in Bender,
Michael A., et al. " Two simplified algorithms for maintaining order in a list."
A node of the doubly-linked list underlying this data structure.
An immutable graph based on the Elias–Fano representation of monotone sequences.
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.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).
A tool that extracts a component from a graph, possibly building an associated identifier list.
An integer represented in fixed width.
A list of integers represented in fixed width.
Deprecated.
A natural number represented in γ coding.
A graph with two parameters: a positive integer (k) and an integer value between 1 and k2.
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.
A small wrapper around JSAP's standard
ClassStringParser.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.
An abstract discount function is a facility to implement a discount function (so that only
the
Int2DoubleFunction.get(int) method must be actually implemented).A simple abstract class representing an immutable graph.
A list of the methods that can be used to load a graph.
An abstract immutable graph that throws an
UnsupportedOperationException
on all random-access methods.An induced subgraph of a given immutable graph.
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.A filter for labelled graphs preserving those arcs whose integer labels are in a specified set.
Exposes a graph in a simple binary format as an (offline-only)
ImmutableGraph.A class exposing a list of triples as an
ArcLabelledImmutableGraph.An iterator returning the integers contained in a sequence of intervals.
A set of attributes that can be used to decorate a node or
an arc of a graph.
A way to merge two labels into one; the actual merge is performed by the
LabelMergeStrategy.merge(Label, Label)
method.A semiring used to compose labels.
A lazy iterator over the integers.
A class providing static methods and objects that do useful
things with lazy integer iterators.
A skippable lazy iterator over the integers.
An iterator returning the element of an underlying iterator but filters
them using a inclusion-exclusion block list.
An iterator returning the union of the integers returned by two
IntIterators.Computes the neighbourhood function of a graph by multiple parallel breadth-first visits.
This interface extends
IntIterator and is used to scan a graph, that is, to read its nodes and their successor lists
sequentially.Computes the neighbourhood function of a node of graph by a parallel breadth-first visit.
The main method of this class loads an arbitrary
ImmutableGraph
and performs a sequential scan to establish the minimum, maximum and average outdegree.Computes the betweenness centrality using a parallel implementation of Brandes's algorithm
(Ulrik Brandes, “A Faster Algorithm for Betweenness Centrality”, Journal of Mathematical Sociology 25(2):163−177, 2001).
An exception telling that the path count exceeded 64-bit integer arithmetic.
Performs breadth-firsts visits of a graph exploiting multicore parallelism.
Simulates the push-pull gossiping algorithm with a single source on a given undirected graph.
Samples a graph via breadth-first visits.
An
ImmutableGraph that corresponds to a graph stored as a scattered list of arcs.An
ArcListASCIIGraph with fixed shift -1.Outputs (onto stdout) an EPS image showing a sketch of the graph adjacency matrix.
Computes basic statistical data about a given graph.
Computes the strongly connected components (and optionally the buckets) of an immutable graph.
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.
The type of output requested: radius, diameter, radius and diameter, all
forward eccentricities, or all (forward and backward) eccentricities.
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.
The type of output requested: radius, diameter, radius and diameter, or
all eccentricities.
Computes the k most central vertices according to a positive geometric centrality.
The centralities with respect to which it is possible to find the top k nodes.
Static methods that manipulate immutable graphs.
Provides a method to accept or reject an arc.
Provides a method to accept or reject a labelled arc.
An arc filter that rejects arcs whose well-known attribute has a value smaller than a given threshold.
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.An arc-labelled immutable graph representing the union of two given such graphs.
An immutable graph representing the union of two given graphs.
A reimplementation of URL better tailored to our needs.
The main method of this class scans TAB-separated list of URLs and matches
it against a given graph.
A tool converting a graph into GraphViz's .dot format.
SumSweepDirectedDiameterRadius/SumSweepUndirectedDiameterRadius.