Class/Object

org.graphframes.examples

Graphs

Related Docs: object Graphs | package examples

Permalink

class Graphs extends AnyRef

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graphs
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to any2stringadd[Graphs] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (Graphs, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to ArrowAssoc[Graphs] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  6. def ALSSyntheticData(): GraphFrame

    Permalink

    Some synthetic data that sits in Spark.

    Some synthetic data that sits in Spark.

    No description available.

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def chain(n: Long): GraphFrame

    Permalink

    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).

  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def empty[T](implicit arg0: scala.reflect.api.JavaUniverse.TypeTag[T]): GraphFrame

    Permalink

    Returns an empty GraphFrame of the given ID type.

  11. def ensuring(cond: (Graphs) ⇒ Boolean, msg: ⇒ Any): Graphs

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to Ensuring[Graphs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: (Graphs) ⇒ Boolean): Graphs

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to Ensuring[Graphs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean, msg: ⇒ Any): Graphs

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to Ensuring[Graphs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: Boolean): Graphs

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to Ensuring[Graphs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  17. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to StringFormat[Graphs] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  19. def friends: GraphFrame

    Permalink

    Graph of friends in a social network.

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

    Permalink
    Definition Classes
    AnyRef → Any
  21. def gridIsingModel(sqlContext: SQLContext, n: Int): GraphFrame

    Permalink

    Version of gridIsingModel with vStd, eStd set to 1.0.

  22. def gridIsingModel(sqlContext: SQLContext, n: Int, vStd: Double, eStd: Double): GraphFrame

    Permalink

    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 xi. Each binary variable xi corresponds to one vertex, and it may take values -1 or +1. The probability distribution P(X) (over all xi) is parameterized by vertex factors ai and edge factors bij:

    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 ai. Each edge is parameterized by a single scalar bij.

    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.

  23. def hashCode(): Int

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

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

    Permalink
    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  28. def star(n: Long): GraphFrame

    Permalink

    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

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

    Permalink
    Definition Classes
    AnyRef
  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  31. def twoBlobs(blobSize: Int): GraphFrame

    Permalink

    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.

  32. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. def [B](y: B): (Graphs, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graphs to ArrowAssoc[Graphs] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from Graphs to any2stringadd[Graphs]

Inherited by implicit conversion StringFormat from Graphs to StringFormat[Graphs]

Inherited by implicit conversion Ensuring from Graphs to Ensuring[Graphs]

Inherited by implicit conversion ArrowAssoc from Graphs to ArrowAssoc[Graphs]

Ungrouped