class Graphs extends AnyRef
- Alphabetic
- By Inheritance
- Graphs
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Graphs, B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def ALSSyntheticData(): GraphFrame
Some synthetic data that sits in Spark.
Some synthetic data that sits in Spark.
No description available.
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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).
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- def empty[T](implicit arg0: scala.reflect.api.JavaUniverse.TypeTag[T]): GraphFrame
Returns an empty GraphFrame of the given ID type.
- def ensuring(cond: (Graphs) => Boolean, msg: => Any): Graphs
- def ensuring(cond: (Graphs) => Boolean): Graphs
- def ensuring(cond: Boolean, msg: => Any): Graphs
- def ensuring(cond: Boolean): Graphs
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def friends: GraphFrame
Graph of friends in a social network.
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def gridIsingModel(spark: SparkSession, n: Int): GraphFrame
Version of
gridIsingModelwith vStd, eStd set to 1.0. - 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 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.
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- 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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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.
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from Graphs toStringFormat[Graphs] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (Graphs, B)
- Implicit
- This member is added by an implicit conversion from Graphs toArrowAssoc[Graphs] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.