object GraphImpl extends Serializable
- Source
- GraphImpl.scala
- Alphabetic
- By Inheritance
- GraphImpl
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[VD, ED](vertices: VertexRDD[VD], edges: EdgeRDD[ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]
Create a graph from a VertexRDD and an EdgeRDD with arbitrary replicated vertices.
Create a graph from a VertexRDD and an EdgeRDD with arbitrary replicated vertices. The VertexRDD must already be set up for efficient joins with the EdgeRDD by calling
VertexRDD.withEdges
or an appropriate VertexRDD constructor. - def apply[VD, ED](vertices: RDD[(VertexId, VD)], edges: RDD[Edge[ED]], defaultVertexAttr: VD, edgeStorageLevel: StorageLevel, vertexStorageLevel: StorageLevel)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]
Create a graph from vertices and edges, setting missing vertices to
defaultVertexAttr
. - def apply[VD, ED](edges: RDD[Edge[ED]], defaultVertexAttr: VD, edgeStorageLevel: StorageLevel, vertexStorageLevel: StorageLevel)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]
Create a graph from edges, setting referenced vertices to
defaultVertexAttr
. - final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def fromEdgePartitions[VD, ED](edgePartitions: RDD[(PartitionID, EdgePartition[ED, VD])], defaultVertexAttr: VD, edgeStorageLevel: StorageLevel, vertexStorageLevel: StorageLevel)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]
Create a graph from EdgePartitions, setting referenced vertices to
defaultVertexAttr
. - def fromExistingRDDs[VD, ED](vertices: VertexRDD[VD], edges: EdgeRDD[ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]
Create a graph from a VertexRDD and an EdgeRDD with the same replicated vertex type as the vertices.
Create a graph from a VertexRDD and an EdgeRDD with the same replicated vertex type as the vertices. The VertexRDD must already be set up for efficient joins with the EdgeRDD by calling
VertexRDD.withEdges
or an appropriate VertexRDD constructor. - final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- 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()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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)