class GraphOps[VD, ED] extends Serializable
Contains additional functionality for Graph. All operations are expressed in terms of the efficient GraphX API. This class is implicitly constructed for each Graph object.
 VD
the vertex attribute type
 ED
the edge attribute type
 Alphabetic
 By Inheritance
 GraphOps
 Serializable
 Serializable
 AnyRef
 Any
 Hide All
 Show All
 Public
 All
Instance Constructors
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

final
def
asInstanceOf[T0]: T0
 Definition Classes
 Any

def
clone(): AnyRef
 Attributes
 protected[lang]
 Definition Classes
 AnyRef
 Annotations
 @throws( ... ) @native()

def
collectEdges(edgeDirection: EdgeDirection): VertexRDD[Array[Edge[ED]]]
Returns an RDD that contains for each vertex v its local edges, i.e., the edges that are incident on v, in the userspecified direction.
Returns an RDD that contains for each vertex v its local edges, i.e., the edges that are incident on v, in the userspecified direction. Warning: note that singleton vertices, those with no edges in the given direction will not be part of the return value.
 edgeDirection
the direction along which to collect the local edges of vertices
 returns
the local edges for each vertex
 Note
This function could be highly inefficient on powerlaw graphs where high degree vertices may force a large amount of information to be collected to a single location.

def
collectNeighborIds(edgeDirection: EdgeDirection): VertexRDD[Array[VertexId]]
Collect the neighbor vertex ids for each vertex.
Collect the neighbor vertex ids for each vertex.
 edgeDirection
the direction along which to collect neighboring vertices
 returns
the set of neighboring ids for each vertex

def
collectNeighbors(edgeDirection: EdgeDirection): VertexRDD[Array[(VertexId, VD)]]
Collect the neighbor vertex attributes for each vertex.
Collect the neighbor vertex attributes for each vertex.
 edgeDirection
the direction along which to collect neighboring vertices
 returns
the vertex set of neighboring vertex attributes for each vertex
 Note
This function could be highly inefficient on powerlaw graphs where high degree vertices may force a large amount of information to be collected to a single location.

def
connectedComponents(maxIterations: Int): Graph[VertexId, ED]
Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.
Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.
 See also
org.apache.spark.graphx.lib.ConnectedComponents.run

def
connectedComponents(): Graph[VertexId, ED]
Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.
Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.
 See also
org.apache.spark.graphx.lib.ConnectedComponents.run

def
convertToCanonicalEdges(mergeFunc: (ED, ED) ⇒ ED = (e1, e2) => e1): Graph[VD, ED]
Convert bidirectional edges into unidirectional ones.
Convert bidirectional edges into unidirectional ones. Some graph algorithms (e.g., TriangleCount) assume that an input graph has its edges in canonical direction. This function rewrites the vertex ids of edges so that srcIds are smaller than dstIds, and merges the duplicated edges.
 mergeFunc
the user defined reduce function which should be commutative and associative and is used to combine the output of the map phase
 returns
the resulting graph with canonical edges

lazy val
degrees: VertexRDD[Int]
The degree of each vertex in the graph.
The degree of each vertex in the graph.
 Annotations
 @transient()
 Note
Vertices with no edges are not returned in the resulting RDD.

final
def
eq(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

def
equals(arg0: Any): Boolean
 Definition Classes
 AnyRef → Any

def
filter[VD2, ED2](preprocess: (Graph[VD, ED]) ⇒ Graph[VD2, ED2], epred: (EdgeTriplet[VD2, ED2]) ⇒ Boolean = (x: EdgeTriplet[VD2, ED2]) => true, vpred: (VertexId, VD2) ⇒ Boolean = (v: VertexId, d: VD2) => true)(implicit arg0: ClassTag[VD2], arg1: ClassTag[ED2]): Graph[VD, ED]
Filter the graph by computing some values to filter on, and applying the predicates.
Filter the graph by computing some values to filter on, and applying the predicates.
 VD2
vertex type the vpred operates on
 ED2
edge type the epred operates on
 preprocess
a function to compute new vertex and edge data before filtering
 epred
edge pred to filter on after preprocess, see more details under org.apache.spark.graphx.Graph#subgraph
 vpred
vertex pred to filter on after preprocess, see more details under org.apache.spark.graphx.Graph#subgraph
 returns
a subgraph of the original graph, with its data unchanged
This function can be used to filter the graph based on some property, without changing the vertex and edge values in your program. For example, we could remove the vertices in a graph with 0 outdegree
graph.filter( graph => { val degrees: VertexRDD[Int] = graph.outDegrees graph.outerJoinVertices(degrees) {(vid, data, deg) => deg.getOrElse(0)} }, vpred = (vid: VertexId, deg:Int) => deg > 0 )
Example: 
def
finalize(): Unit
 Attributes
 protected[lang]
 Definition Classes
 AnyRef
 Annotations
 @throws( classOf[java.lang.Throwable] )

final
def
getClass(): Class[_]
 Definition Classes
 AnyRef → Any
 Annotations
 @native()

def
hashCode(): Int
 Definition Classes
 AnyRef → Any
 Annotations
 @native()

lazy val
inDegrees: VertexRDD[Int]
The indegree of each vertex in the graph.
The indegree of each vertex in the graph.
 Annotations
 @transient()
 Note
Vertices with no inedges are not returned in the resulting RDD.

final
def
isInstanceOf[T0]: Boolean
 Definition Classes
 Any

def
joinVertices[U](table: RDD[(VertexId, U)])(mapFunc: (VertexId, VD, U) ⇒ VD)(implicit arg0: ClassTag[U]): Graph[VD, ED]
Join the vertices with an RDD and then apply a function from the vertex and RDD entry to a new vertex value.
Join the vertices with an RDD and then apply a function from the vertex and RDD entry to a new vertex value. The input table should contain at most one entry for each vertex. If no entry is provided the map function is skipped and the old value is used.
 U
the type of entry in the table of updates
 table
the table to join with the vertices in the graph. The table should contain at most one entry for each vertex.
 mapFunc
the function used to compute the new vertex values. The map function is invoked only for vertices with a corresponding entry in the table otherwise the old vertex value is used.
This function is used to update the vertices with new values based on external data. For example we could add the out degree to each vertex record
val rawGraph: Graph[Int, Int] = GraphLoader.edgeListFile(sc, "webgraph") .mapVertices((_, _) => 0) val outDeg = rawGraph.outDegrees val graph = rawGraph.joinVertices[Int](outDeg) ((_, _, outDeg) => outDeg)
Example: 
final
def
ne(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

final
def
notify(): Unit
 Definition Classes
 AnyRef
 Annotations
 @native()

final
def
notifyAll(): Unit
 Definition Classes
 AnyRef
 Annotations
 @native()

lazy val
numEdges: Long
The number of edges in the graph.
The number of edges in the graph.
 Annotations
 @transient()

lazy val
numVertices: Long
The number of vertices in the graph.
The number of vertices in the graph.
 Annotations
 @transient()

lazy val
outDegrees: VertexRDD[Int]
The outdegree of each vertex in the graph.
The outdegree of each vertex in the graph.
 Annotations
 @transient()
 Note
Vertices with no outedges are not returned in the resulting RDD.

def
pageRank(tol: Double, resetProb: Double = 0.15): Graph[Double, Double]
Run a dynamic version of PageRank returning a graph with vertex attributes containing the PageRank and edge attributes containing the normalized edge weight.
Run a dynamic version of PageRank returning a graph with vertex attributes containing the PageRank and edge attributes containing the normalized edge weight.

def
personalizedPageRank(src: VertexId, tol: Double, resetProb: Double = 0.15): Graph[Double, Double]
Run personalized PageRank for a given vertex, such that all random walks are started relative to the source node.
Run personalized PageRank for a given vertex, such that all random walks are started relative to the source node.

def
pickRandomVertex(): VertexId
Picks a random vertex from the graph and returns its ID.

def
pregel[A](initialMsg: A, maxIterations: Int = Int.MaxValue, activeDirection: EdgeDirection = EdgeDirection.Either)(vprog: (VertexId, VD, A) ⇒ VD, sendMsg: (EdgeTriplet[VD, ED]) ⇒ Iterator[(VertexId, A)], mergeMsg: (A, A) ⇒ A)(implicit arg0: ClassTag[A]): Graph[VD, ED]
Execute a Pregellike iterative vertexparallel abstraction.
Execute a Pregellike iterative vertexparallel abstraction. The userdefined vertexprogram
vprog
is executed in parallel on each vertex receiving any inbound messages and computing a new value for the vertex. ThesendMsg
function is then invoked on all outedges and is used to compute an optional message to the destination vertex. ThemergeMsg
function is a commutative associative function used to combine messages destined to the same vertex.On the first iteration all vertices receive the
initialMsg
and on subsequent iterations if a vertex does not receive a message then the vertexprogram is not invoked.This function iterates until there are no remaining messages, or for
maxIterations
iterations. A
the Pregel message type
 initialMsg
the message each vertex will receive at the on the first iteration
 maxIterations
the maximum number of iterations to run for
 activeDirection
the direction of edges incident to a vertex that received a message in the previous round on which to run
sendMsg
. For example, if this isEdgeDirection.Out
, only outedges of vertices that received a message in the previous round will run. vprog
the userdefined vertex program which runs on each vertex and receives the inbound message and computes a new vertex value. On the first iteration the vertex program is invoked on all vertices and is passed the default message. On subsequent iterations the vertex program is only invoked on those vertices that receive messages.
 sendMsg
a user supplied function that is applied to out edges of vertices that received messages in the current iteration
 mergeMsg
a user supplied function that takes two incoming messages of type A and merges them into a single message of type A. This function must be commutative and associative and ideally the size of A should not increase.
 returns
the resulting graph at the end of the computation

def
removeSelfEdges(): Graph[VD, ED]
Remove self edges.
Remove self edges.
 returns
a graph with all self edges removed

def
staticPageRank(numIter: Int, resetProb: Double, prePageRank: Graph[Double, Double]): Graph[Double, Double]
Run PageRank for a fixed number of iterations returning a graph with vertex attributes containing the PageRank and edge attributes the normalized edge weight, optionally including including a previous pageRank computation to be used as a start point for the new iterations
Run PageRank for a fixed number of iterations returning a graph with vertex attributes containing the PageRank and edge attributes the normalized edge weight, optionally including including a previous pageRank computation to be used as a start point for the new iterations

def
staticPageRank(numIter: Int, resetProb: Double = 0.15): Graph[Double, Double]
Run PageRank for a fixed number of iterations returning a graph with vertex attributes containing the PageRank and edge attributes the normalized edge weight.
Run PageRank for a fixed number of iterations returning a graph with vertex attributes containing the PageRank and edge attributes the normalized edge weight.

def
staticParallelPersonalizedPageRank(sources: Array[VertexId], numIter: Int, resetProb: Double = 0.15): Graph[Vector, Double]
Run parallel personalized PageRank for a given array of source vertices, such that all random walks are started relative to the source vertices

def
staticPersonalizedPageRank(src: VertexId, numIter: Int, resetProb: Double = 0.15): Graph[Double, Double]
Run Personalized PageRank for a fixed number of iterations with with all iterations originating at the source node returning a graph with vertex attributes containing the PageRank and edge attributes the normalized edge weight.
Run Personalized PageRank for a fixed number of iterations with with all iterations originating at the source node returning a graph with vertex attributes containing the PageRank and edge attributes the normalized edge weight.

def
stronglyConnectedComponents(numIter: Int): Graph[VertexId, ED]
Compute the strongly connected component (SCC) of each vertex and return a graph with the vertex value containing the lowest vertex id in the SCC containing that vertex.
Compute the strongly connected component (SCC) of each vertex and return a graph with the vertex value containing the lowest vertex id in the SCC containing that vertex.

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

def
toString(): String
 Definition Classes
 AnyRef → Any

def
triangleCount(): Graph[Int, ED]
Compute the number of triangles passing through each vertex.
Compute the number of triangles passing through each vertex.

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

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

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