Package it.unimi.dsi.webgraph.scratch
package it.unimi.dsi.webgraph.scratch
-
ClassDescriptionOutputs (onto stdout) an EPS image showing a sketch of the graph adjacency matrix.Outputs (onto stdout) the graph adjacency matrix in SMAT format.Reads a list of URLs from standard input and writes to standard output a host map in
DataOutput
format.DynamicDAG<K>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.A graph with two parameters: a positive integer (k) and an integer value between 1 and k2.Computes the neighbourhood function of a node of graph by a parallel breadth-first visit.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.Simulates the push-pull gossiping algorithm with a single source on a given undirected graph.Outputs (onto stdout) an EPS image showing a sketch of the graph adjacency matrix.