scalation.graphalytics

GraphGenerator

object GraphGenerator

The GraphGenerator object is used to build random graph with various characteristics.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphGenerator
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

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

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

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

    Definition Classes
    Any
  5. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef → Any
  8. def extractSubgraph(size: Int, g: Graph): Graph

    Extracts a subgraph of 'size' vertices from graph 'g' by performing a breadth-first search from a random vertex.

    Extracts a subgraph of 'size' vertices from graph 'g' by performing a breadth-first search from a random vertex.

    size

    the number of vertices to extract

    g

    the data graph to extract from

  9. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def genBFSQuery(size: Int, avDegree: Int, g: Graph): Graph

    Given a graph 'g', performs a breadth first search starting at a random vertex until the breadth first tree contains 'size' vertices.

    Given a graph 'g', performs a breadth first search starting at a random vertex until the breadth first tree contains 'size' vertices. At each junction, it chooses a random number of children to traverse, with that random number averaging to 'avDegree'.

    size

    the number of vertices to extract

    avDegree

    the average out degree

    g

    the data graph to extract from

  11. def genPowerLawGraph(size: Int, nLabels: Int, maxDegree: Int, distPow: Double): Graph

    Generates a graph with power law degree distribution with exponent 'distPow' and uniformly distributed labels.

    Generates a graph with power law degree distribution with exponent 'distPow' and uniformly distributed labels.

    size

    the number of vertices

    nLabels

    the number of labels (distributed uniformly)

    maxDegree

    the maximum allowed degree for any vertex

    distPow

    the power/exponent

  12. def genPowerLawGraph_PowLabels(size: Int, nLabels: Int, maxDegree: Int, distPow: Double): Graph

    Generates a graph with power law degree distribution with exponent 'distPow' and power law distributed labels.

    Generates a graph with power law degree distribution with exponent 'distPow' and power law distributed labels.

    size

    the number of vertices

    nLabels

    the number of labels (distributed according to power law)

    maxDegree

    the maximum allowed degree for any vertex

    distPow

    the power/exponent

  13. def genRandomConnectedGraph(size: Int, nLabels: Int, avDegree: Int): Graph

    Generates a random connected graph by using genRandomGraph and checking whether it is connected.

    Generates a random connected graph by using genRandomGraph and checking whether it is connected.

    size

    the number of vertices to generate

    nLabels

    the number of labels (distributed uniformly)

    avDegree

    the average degree

  14. def genRandomGraph(size: Int, nLabels: Int, avDegree: Int): Graph

    Generates a random graph with the specified size (number of vertices), average degree and labels evenly distributed across vertices from 0 to nLabels - 1.

    Generates a random graph with the specified size (number of vertices), average degree and labels evenly distributed across vertices from 0 to nLabels - 1. Not necessarily a connected graph.

    size

    the number of vertices to generate

    nLabels

    the number of labels (distributed uniformly)

    avDegree

    the average degree

  15. def genRandomGraph_PowLabels(size: Int, nLabels: Int, avDegree: Int): Graph

    Generates a random graph with labels distributed based on a power law distribution (currently with the magic number 2.

    Generates a random graph with labels distributed based on a power law distribution (currently with the magic number 2.1 for the power law exponent).

    size

    the number of vertices to generate

    nLabels

    the number of labels (distributed according to power law)

    avDegree

    the average degree

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

    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int

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

    Definition Classes
    Any
  19. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  20. final def notify(): Unit

    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  22. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  23. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped