GraphImpl

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

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

7. def apply[VD, ED](vertices: RDD[(VertexId, VD)], edges: RDD[Edge[ED]], defaultVertexAttr: VD)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]

   Create a graph from vertices and edges, setting missing vertices to defaultVertexAttr.

8. def apply[VD, ED](edges: RDD[Edge[ED]], defaultVertexAttr: VD)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]

   Create a graph from edges, setting referenced vertices to defaultVertexAttr.

9. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

10. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

11. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

13. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

14. def fromEdgePartitions[VD, ED](edgePartitions: RDD[(PartitionID, EdgePartition[ED, VD])], defaultVertexAttr: VD)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphImpl[VD, ED]

    Create a graph from EdgePartitions, setting referenced vertices to defaultVertexAttr.

15. def fromExistingRDDs[VD, ED](vertices: VertexRDD[VD], edges: EdgeRDD[ED, VD])(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.

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

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

20. final def notify(): Unit

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

23. def toString(): String

    Definition Classes

    AnyRef → Any

24. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )