Packages

object MGraphGen

The MGraphGen companion object provides simple methods for creating data and query graphs.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MGraphGen
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
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 buildQGraph[TLabel](nodes: Set[Int], chMap: Map[Int, Set[Int]], gLabel: Array[TLabel], gELabel: Map[(Int, Int), TLabel], inverse: Boolean, name: String)(implicit arg0: ClassTag[TLabel]): MGraph[TLabel]

    Build a query graph from the subgraph extracted from the data graph.

    Build a query graph from the subgraph extracted from the data graph. Includes the renumbering of vertex ids.

    nodes

    the nodes extracted from the data graph

    chMap

    the child map: vertex -> children

    gLabel

    the labels from the data graph

    inverse

    whether to create inverse adjacency (parents)

    name

    the name for the new query graph

  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def extractSubgraph[TLabel](size: Int, g: MGraph[TLabel], inverse: Boolean = false, name: String = "g", stream: Int = 0)(implicit arg0: ClassTag[TLabel]): MGraph[TLabel]

    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

    inverse

    whether to create inverse adjacency (parents)

    name

    the name of the graph

  10. def genGraph[TLabel](typeSel: TLabel, stream: Int = 0, gSize: Int = 100, nLabels: Int = 50, eLabels: Int = 5, gAvDegree: Int = 8, addPa: Boolean = false)(implicit arg0: ClassTag[TLabel]): MGraph[TLabel]

    Randomly generate a data graph 'g'.

    Randomly generate a data graph 'g'.

    typeSel

    the type selector

    gSize

    the size of the data graph

    nLabels

    the number of distinct labels

    gAvDegree

    the average vertex out-degree for data graph

    addPa

    whether to add direct references to parents

  11. def genGraphs[TLabel](typeSel: TLabel, stream: Int = 0, gSize: Int = 100, qSize: Int = 10, nLabels: Int = 50, eLabels: Int = 5, gAvDegree: Int = 8, qAvDegree: Int = 2, addPa: Boolean = false)(implicit arg0: ClassTag[TLabel]): (MGraph[TLabel], MGraph[TLabel])

    Randomly generate both a data graph 'g' and a query graph 'q'.

    Randomly generate both a data graph 'g' and a query graph 'q'.

    typeSel

    the type selector

    gSize

    the size of the data graph

    qSize

    the size of the query graph

    nLabels

    the number of distinct labels

    gAvDegree

    the average vertex out-degree for data graph

    qAvDegree

    the average vertex out-degree for query graph

    addPa

    whether to add direct references to parents

  12. def genPowerGraphs[TLabel](typeSel: TLabel, stream: Int = 0, gSize: Int = 100, qSize: Int = 10, nLabels: Int = 50, eLabels: Int = 5, gAvDegree: Int = 8, qAvDegree: Int = 2, addPa: Boolean = false)(implicit arg0: ClassTag[TLabel]): (MGraph[TLabel], MGraph[TLabel])

    Randomly generate both a data graph 'g' and a query graph 'q' using Power Law

    Randomly generate both a data graph 'g' and a query graph 'q' using Power Law

    typeSel

    the type selector

    gSize

    the size of the data graph

    qSize

    the size of the query graph

    nLabels

    the number of distinct labels

    gAvDegree

    the average vertex out-degree for data graph

    qAvDegree

    the average vertex out-degree for query graph

    addPa

    whether to add direct references to parents

  13. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped