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.  def ALSSyntheticData(): GraphFrame

   Some synthetic data that sits in Spark.

   Some synthetic data that sits in Spark.

   No description available.

   Definition Classes

   Graphs

5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def chain(n: Long): GraphFrame

   Returns a chain graph of the given size with Long ID type.

   Returns a chain graph of the given size with Long ID type. The vertex IDs are 0, 1, ..., n-1, and the edges are (0, 1), (1, 2), ...., (n-2, n-1).

   Definition Classes

   Graphs

7.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

8.  def empty[T](implicit arg0: scala.reflect.api.JavaUniverse.TypeTag[T]): GraphFrame

   Returns an empty GraphFrame of the given ID type.

   Returns an empty GraphFrame of the given ID type.

   Definition Classes

   Graphs

9.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

11.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

12.  def friends: GraphFrame

    Graph of friends in a social network.

    Graph of friends in a social network.

    Definition Classes

    Graphs

13.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

14.  def gridIsingModel(spark: SparkSession, n: Int): GraphFrame

    Version of gridIsingModel with vStd, eStd set to 1.0.

    Version of gridIsingModel with vStd, eStd set to 1.0.

    Definition Classes

    Graphs

15.  def gridIsingModel(spark: SparkSession, n: Int, vStd: Double, eStd: Double): GraphFrame

    This method generates a grid Ising model with random parameters.

    This method generates a grid Ising model with random parameters.

    Ising models are probabilistic graphical models over binary variables x_i. Each binary variable x_i corresponds to one vertex, and it may take values -1 or +1. The probability distribution P(X) (over all x_i) is parameterized by vertex factors a_i and edge factors b_ij:

    P(X) = (1/Z) * exp[ \sum_i a_i x_i + \sum_{ij} b_{ij} x_i x_j ]

    where Z is the normalization constant (partition function). See Wikipedia for more information on Ising models.

    Each vertex is parameterized by a single scalar a_i. Each edge is parameterized by a single scalar b_ij.

    n

    Length of one side of the grid. The grid will be of size n x n.

    vStd

    Standard deviation of normal distribution used to generate vertex factors "a". Default of 1.0.

    eStd

    Standard deviation of normal distribution used to generate edge factors "b". Default of 1.0.

    returns

    GraphFrame. Vertices have columns "id" and "a". Edges have columns "src", "dst", and "b". Edges are directed, but they should be treated as undirected in any algorithms run on this model. Vertex IDs are of the form "i,j". E.g., vertex "1,3" is in the second row and fourth column of the grid.

    Definition Classes

    Graphs

16.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

17.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

18.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

19.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

20.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

21.  def star(n: Long): GraphFrame

    Returns a star graph with Long ID type, consisting of a central element indexed 0 (the root) and the n other leaf vertices 1, 2, ..., n.

    Returns a star graph with Long ID type, consisting of a central element indexed 0 (the root) and the n other leaf vertices 1, 2, ..., n.

    n

    the number of leaves

    Definition Classes

    Graphs

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

    Definition Classes

    AnyRef

23.  def toString(): String

    Definition Classes

    AnyRef → Any

24.  def twoBlobs(blobSize: Int): GraphFrame

    Two densely connected blobs (vertices 0->n-1 and n->2n-1) connected by a single edge (0->n)

    Two densely connected blobs (vertices 0->n-1 and n->2n-1) connected by a single edge (0->n)

    blobSize

    the size of each blob.

    Definition Classes

    Graphs

25.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()