Here is a screenshot of our generator:
Our Barabasi graph generator is a graph generator based on the Barabasi model which is designed to create graphs which possess power laws associated with the outdegree of the nodes.
Operation of the Barabasi graph generator
The Barabasi graph generator creats graphs as follows: A specified number of initial unconnected nodes are created. Upon each iteration of the generator, a new node is added and edges from this new node are added to the current pool of nodes. The selection process of which nodes to connect to can be specified by the generator and includes a preferential method based on the degree of the nodes and a random choice method. The generator runs for a specified number of iterations. Other options are allowed in the generator which include whether a fixed number of edges are added upon each iteration or a random number. The output is a log-log plot of degree vrs. frequency with correlation coefficient and slope.
Reference:
http://www.nd.edu/~networks/Papers/science.pdf
Language:
Our generator is written in Perl, with an interface designed using Perl/Tk. This script has been tested on both Windows NT and Linux. You will need Perl and the Tk libraries to run this script: see www.cspan.org for information on obtaining Perl and theTk libraries for your system.
Download:
Download the Barabasi Graph Generator here