Object

pegasus.spark.graphgen

RMATGenerator

Related Doc: package graphgen

Permalink

object RMATGenerator

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RMATGenerator
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class RMAT extends AnyRef

    Permalink

    rmat generator

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

    Permalink

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

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  12. val logger: Logger

    Permalink

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

    Permalink

    The main entry point

    The main entry point

    args

    [0]: level of recursion. [1]: the number of edges. [2]: degree of parallelism (the number of tasks to run). [3], [4], [5], [6]: the probabilities of quarters. [7]: noise for smoothing

  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. def regionOrder(r: Region): Long

    Permalink

  18. def regionSlotOrder(s: RegionSlot): Long

    Permalink

  19. def run(level: Int, numEdges: Long, numTasks: Int, abcd: (Double, Double, Double, Double), noise: Double, sc: SparkContext): RDD[(Long, Long)]

    Permalink

    submit the spark job.

    submit the spark job.

    level

    of recursion

    numEdges

    the number of edges

    numTasks

    degree of parallelism (the number of tasks to run)

    abcd

    the probabilities of quarters.

    noise

    for smoothing

    sc

    spark context

    returns

    an RDD containing edges of the generated graph

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

    Permalink
    Definition Classes
    AnyRef

  21. val thresholdRegionEdgeNum: Int

    Permalink

  22. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  23. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped