org.apache.spark.graphx

Graph

object Graph extends Serializable

The Graph object contains a collection of routines used to construct graphs from RDDs.

Source
Graph.scala
Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Graph
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

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: RDD[(VertexId, VD)], edges: RDD[Edge[ED]], defaultVertexAttr: VD = null.asInstanceOf[VD], edgeStorageLevel: StorageLevel = StorageLevel.MEMORY_ONLY, vertexStorageLevel: StorageLevel = StorageLevel.MEMORY_ONLY)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): Graph[VD, ED]

    Construct a graph from a collection of vertices and edges with attributes.

    Construct a graph from a collection of vertices and edges with attributes. Duplicate vertices are picked arbitrarily and vertices found in the edge collection but not in the input vertices are assigned the default attribute.

    VD

    the vertex attribute type

    ED

    the edge attribute type

    vertices

    the "set" of vertices and their attributes

    edges

    the collection of edges in the graph

    defaultVertexAttr

    the default vertex attribute to use for vertices that are mentioned in edges but not in vertices

    edgeStorageLevel

    the desired storage level at which to cache the edges if necessary

    vertexStorageLevel

    the desired storage level at which to cache the vertices if necessary

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def fromEdgeTuples[VD](rawEdges: RDD[(VertexId, VertexId)], defaultValue: VD, uniqueEdges: Option[PartitionStrategy] = None, edgeStorageLevel: StorageLevel = StorageLevel.MEMORY_ONLY, vertexStorageLevel: StorageLevel = StorageLevel.MEMORY_ONLY)(implicit arg0: ClassTag[VD]): Graph[VD, Int]

    Construct a graph from a collection of edges encoded as vertex id pairs.

    Construct a graph from a collection of edges encoded as vertex id pairs.

    rawEdges

    a collection of edges in (src, dst) form

    defaultValue

    the vertex attributes with which to create vertices referenced by the edges

    uniqueEdges

    if multiple identical edges are found they are combined and the edge attribute is set to the sum. Otherwise duplicate edges are treated as separate. To enable uniqueEdges, a PartitionStrategy must be provided.

    edgeStorageLevel

    the desired storage level at which to cache the edges if necessary

    vertexStorageLevel

    the desired storage level at which to cache the vertices if necessary

    returns

    a graph with edge attributes containing either the count of duplicate edges or 1 (if uniqueEdges is None) and vertex attributes containing the total degree of each vertex.

  13. def fromEdges[VD, ED](edges: RDD[Edge[ED]], defaultValue: VD, edgeStorageLevel: StorageLevel = StorageLevel.MEMORY_ONLY, vertexStorageLevel: StorageLevel = StorageLevel.MEMORY_ONLY)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): Graph[VD, ED]

    Construct a graph from a collection of edges.

    Construct a graph from a collection of edges.

    edges

    the RDD containing the set of edges in the graph

    defaultValue

    the default vertex attribute to use for each vertex

    edgeStorageLevel

    the desired storage level at which to cache the edges if necessary

    vertexStorageLevel

    the desired storage level at which to cache the vertices if necessary

    returns

    a graph with edge attributes described by edges and vertices given by all vertices in edges with value defaultValue

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

    Definition Classes
    AnyRef → Any
  15. implicit def graphToGraphOps[VD, ED](g: Graph[VD, ED])(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): GraphOps[VD, ED]

    Implicitly extracts the GraphOps member from a graph.

    Implicitly extracts the GraphOps member from a graph.

    To improve modularity the Graph type only contains a small set of basic operations. All the convenience operations are defined in the GraphOps class which may be shared across multiple graph implementations.

  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  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
  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  22. def toString(): String

    Definition Classes
    AnyRef → Any
  23. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped