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 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 finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def genGraph[TLabel](typeSel: TLabel, stream: Int = 0, gSize: Int = 100, nLabels: Int = 100, 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

  10. def genGraphs[TLabel](typeSel: TLabel, stream: Int = 0, gSize: Int = 100, qSize: Int = 10, nLabels: Int = 100, 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

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

Inherited from AnyRef

Inherited from Any

Ungrouped