public class SequentialPageRank extends Object
Program that computes PageRank for a graph using the JUNG package (2.0 alpha1). Program takes two command-line arguments: the first is a file containing the graph data, and the second is the random jump factor (a typical setting is 0.15).
The graph should be represented as an adjacency list. Each line should have at least one token; tokens should be tab delimited. The first token represents the unique id of the source node; subsequent tokens represent its link targets (i.e., outlinks from the source node). For completeness, there should be a line representing all nodes, even nodes without outlinks (those lines will simply contain one token, the source node id).
public static void main(String[] args) throws IOException
IOExceptionCopyright © 2015. All rights reserved.