KroneckerGenerator

Type Members

case class Region(srcMin: Long, dstMin: Long, level: Int, numEdges: Long) extends Product with Serializable

a region.
a region.
srcMin
the minimum source node id in the region
dstMin
the minimum destination node id in the region
level
of recursion
numEdges
the number of edges in the region
case class RegionSlot(edgeCapacity: Long, regions: Buffer[Region]) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def generate(region: Region, seedGraph: Array[(Int, Int)]): Stream[(Long, Long)]

generate edges within a given region
generate edges within a given region
region
to process
seedGraph
array of edges of the seed graph
returns
list of edges in the region
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def main(args: Array[String]): Unit
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def parseSeedGraph(seedGraphPath: String): Array[(Int, Int)]

read seed graph.
read seed graph.
seedGraphPath
seed graph file path
returns
the array of edges in the seed graph
def regionOrder(r: Region): Long
def regionSlotOrder(s: RegionSlot): Long
def run(level: Int, seedGraph: Array[(Int, Int)], numTasks: Int, sc: SparkContext): RDD[(Long, Long)]

submit the spark job.
submit the spark job.
level
of recursion
seedGraph
array of edges of the seed graph
numTasks
degree of parallelism (the number of tasks to run)
sc
spark context
returns
an RDD containing edges of the generated graph
def splitRegion(region: Region, seedGraph: Array[(Int, Int)]): Array[Region]

split a region
split a region
region
to split
seedGraph
array of edges of the seed graph
returns
list of splitted regions
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package graphgen

object KroneckerGenerator

Type Members

case class Region(srcMin: Long, dstMin: Long, level: Int, numEdges: Long) extends Product with Serializable

case class RegionSlot(edgeCapacity: Long, regions: Buffer[Region]) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def generate(region: Region, seedGraph: Array[(Int, Int)]): Stream[(Long, Long)]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def main(args: Array[String]): Unit

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parseSeedGraph(seedGraphPath: String): Array[(Int, Int)]

def regionOrder(r: Region): Long

def regionSlotOrder(s: RegionSlot): Long

def run(level: Int, seedGraph: Array[(Int, Int)], numTasks: Int, sc: SparkContext): RDD[(Long, Long)]

def splitRegion(region: Region, seedGraph: Array[(Int, Int)]): Array[Region]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped