RandomGraphs::PowerLawRandomGraph Class Reference

Inheritance diagram for RandomGraphs::PowerLawRandomGraph:

List of all members.

---

Detailed Description

Generates a synthetic Web graph or Power Law graph using an RMAT algorithm.

Public Member Functions
def	__init__
	Constructs an empty graph.
def	setProbs
	Sets the probability with which quadrants in an adjacency matrix are chosen.
def	generate
	Generates a the graph.
def	populate
	Populate graph with edges generated after a call to PowerLawRandomGraph::generate.
def	writeEdges
	Write edges to file.
Public Attributes
	graphSize
	Number of vertices to be considered for generation.
	noOfEdges
	Number of edges to generate.
	probA
	Parameters of the RMAT algorithm. Probability of choosing quadrant A.
	probB
	Probability of choosing quadrant B.
	probC
	Probability of choosing quadrant C.
	probD
	Probability of choosing quadrant D.
	serialEdgeList
	Temporary storage of edges.
	debug
	Debug flag.
	startVertX
	endVertX
	startVertY
	endVertY

---

Member Function Documentation

def RandomGraphs::PowerLawRandomGraph::__init__ (    self,   size,   noOfEdges )

Constructs an empty graph. Parameters: size  Number of vertices to be considered for generation noOfEdges  Number of edges to generate

def RandomGraphs::PowerLawRandomGraph::generate (    self,   noOfThreads )

Generates a the graph. Heart of web graph generation algorithm. Each thread gets an equal number of nodes to generate. Parameters: noOfThreads  Number of threads to spawn for the graph generation. More threads does not correspond to fast generation

def RandomGraphs::PowerLawRandomGraph::populate (    self  )

Populate graph with edges generated after a call to PowerLawRandomGraph::generate. You should call this method before you can use any of the non-overridden method in Graph::NumberedEdgeGraph

def RandomGraphs::PowerLawRandomGraph::setProbs (    self,   probA,   probB,   probC,   probD )

Sets the probability with which quadrants in an adjacency matrix are chosen. Parameters: probA  Probability of choosing quadrant A probB  Probability of choosing quadrant B probC  Probability of choosing quadrant C probD  Probability of choosing quadrant D Exceptions: PackageExceptions::DistError

def RandomGraphs::PowerLawRandomGraph::writeEdges (    self,   fileName,   format )

Write edges to file. Parameters: fileName  File name to store edges format  Format of output file. Can take values: 'simple' = simple format 'dot' = format compatible with 'dot' command Reimplemented from Graph::NumberedEdgeGraph.

---

Member Data Documentation

RandomGraphs::PowerLawRandomGraph::probA

Parameters of the RMAT algorithm. Probability of choosing quadrant A. Decide the probability with which quadrants in an adjacency matrix are chosen Todo: Add description about choosing these probabilities

RandomGraphs::PowerLawRandomGraph::serialEdgeList

Temporary storage of edges. Maintained for achieving performance

---