Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package apache
    Definition Classes
    org
  • package spark

    Core Spark functionality.

    Core Spark functionality. org.apache.spark.SparkContext serves as the main entry point to Spark, while org.apache.spark.rdd.RDD is the data type representing a distributed collection, and provides most parallel operations.

    In addition, org.apache.spark.rdd.PairRDDFunctions contains operations available only on RDDs of key-value pairs, such as groupByKey and join; org.apache.spark.rdd.DoubleRDDFunctions contains operations available only on RDDs of Doubles; and org.apache.spark.rdd.SequenceFileRDDFunctions contains operations available on RDDs that can be saved as SequenceFiles. These operations are automatically available on any RDD of the right type (e.g. RDD[(Int, Int)] through implicit conversions.

    Java programmers should reference the org.apache.spark.api.java package for Spark programming APIs in Java.

    Classes and methods marked with Experimental are user-facing features which have not been officially adopted by the Spark project. These are subject to change or removal in minor releases.

    Classes and methods marked with Developer API are intended for advanced users want to extend Spark through lower level interfaces. These are subject to changes or removal in minor releases.

    Definition Classes
    apache
  • package graphx

    ALPHA COMPONENT GraphX is a graph processing framework built on top of Spark.

    ALPHA COMPONENT GraphX is a graph processing framework built on top of Spark.

    Definition Classes
    spark
  • package impl
    Definition Classes
    graphx
  • EdgeActiveness
  • EdgeRDDImpl
  • GraphImpl
  • VertexRDDImpl

object GraphImpl extends Serializable

Source
GraphImpl.scala
Linear Supertypes
Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphImpl
  2. Serializable
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

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

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

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

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

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