Package it.unimi.dsi.webgraph
package it.unimi.dsi.webgraph
Main classes implementing the WebGraph algorithms.
-
ClassDescriptionAn abstract implementation of a lazy integer iterator, implementing
AbstractLazyIntIterator.skip(int)
by repeated calls tonextInt()
.AnImmutableGraph
that corresponds to graphs stored in a human-readable ASCII format were each line contains an arc.A very simple mutable graph class based onIntArrayList
s.AnImmutableGraph
that corresponds to graphs stored in a human-readable ASCII format where each line contains the list of successors of a given node.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.A subclass ofImmutableSubgraph
exposing the subgraph formed by nodes whose outdegree is in a given range.An immutable graph based on the Elias–Fano representation of monotone sequences.A small wrapper around JSAP's standardClassStringParser
.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 anUnsupportedOperationException
on all random-access methods.An induced subgraph of a given immutable graph.An adapter exposing anImmutableGraph
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.An iterator returning the integers contained in a sequence of intervals.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 twoIntIterator
s.This interface extendsIntIterator
and is used to scan a graph, that is, to read its nodes and their successor lists sequentially.AnImmutableGraph
that corresponds to a graph stored as a scattered list of arcs.AnArcListASCIIGraph
with fixed shift -1.Computes basic statistical data about a given graph.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 parameterkeepOnlySame
is true) or to different (ifkeepOnlySame
is false) classes.An immutable graph representing the union of two given graphs.