| AdjMatrixPSOut |
Outputs (onto stdout) an EPS image showing a sketch of the graph adjacency matrix.
|
| AdjMatrixSmatOut |
Outputs (onto stdout) the graph adjacency matrix in SMAT format.
|
| BuildHostList |
Reads a list of URLs from standard input and writes to standard output a host map
in DataOutput format.
|
| ComputeClassSizes |
|
| ComputeHopPlotVariance |
|
| ConvertArcFile |
|
| ConvertToClusteringFormat |
|
| 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.
|
| DynamicDAG.DAGNode<K> |
The type of a DAG node.
|
| DynamicOrderedList<K> |
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."
|
| DynamicOrderedList.DOLNode<K> |
A node of the doubly-linked list underlying this data structure.
|
| FibrationAnalysis |
|
| GeneralizedDumbelGraph |
A graph with two parameters: a positive integer (k) and an integer value between 1 and k2.
|
| MergeAndRenumber |
|
| NodeNeighbourhoodFunction |
|
| OrderLabel |
|
| ParallelBreadthFirstBetweennessCentrality |
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).
|
| PrintDeltas |
|
| ProductOfCliques |
|
| PushPullGossip |
Simulates the push-pull gossiping algorithm with a single source on a given undirected graph.
|
| ReachabilityStats |
|
| SimRank |
|
| SimRank.GrayComparator |
|
| SimRank.HilbertComparator |
|
| SimRank.MortonComparator |
|
| SimRank.UComparator |
|
| SimRank.VignaComparator |
|
| SimRankH |
|
| SmatToPS |
Outputs (onto stdout) an EPS image showing a sketch of the graph adjacency matrix.
|