Class GraphImpl<VD,ED>
1
Object
2
org.apache.spark.graphx.Graph<VD,ED>
3
org.apache.spark.graphx.impl.GraphImpl<VD,ED>
4
​
5
All Implemented Interfaces:
6
java.io.Serializable
7
​
Copied!
Methods:
1
<A> VertexRDD<A> aggregateMessagesWithActiveSet(scala.Function1<EdgeContext<VD,ED,A>,scala.runtime.BoxedUnit> sendMsg, scala.Function2<A,A,A> mergeMsg, TripletFields tripletFields, scala.Option<scala.Tuple2<VertexRDD<?>,EdgeDirection>> activeSetOpt, scala.reflect.ClassTag<A> evidence$10)
2
​
3
static <VD,ED> GraphImpl<VD,ED> apply(RDD<Edge<ED>> edges, VD defaultVertexAttr, StorageLevel edgeStorageLevel, StorageLevel vertexStorageLevel, scala.reflect.ClassTag<VD> evidence$13, scala.reflect.ClassTag<ED> evidence$14)
4
​
5
Create a graph from edges, setting referenced vertices to defaultVertexAttr.
6
​
7
static <VD,ED> GraphImpl<VD,ED> apply(RDD<scala.Tuple2<Object,VD>> vertices, RDD<Edge<ED>> edges, VD defaultVertexAttr, StorageLevel edgeStorageLevel, StorageLevel vertexStorageLevel, scala.reflect.ClassTag<VD> evidence$17, scala.reflect.ClassTag<ED> evidence$18)
8
​
9
Create a graph from vertices and edges, setting missing vertices to defaultVertexAttr.
10
​
11
static <VD,ED> GraphImpl<VD,ED> apply(VertexRDD<VD> vertices, EdgeRDD<ED> edges, scala.reflect.ClassTag<VD> evidence$19, scala.reflect.ClassTag<ED> evidence$20)
12
​
13
Create a graph from a VertexRDD and an EdgeRDD with arbitrary replicated vertices.
14
​
15
Graph<VD,ED> cache()
16
​
17
Caches the vertices and edges associated with this graph at the previously-specified target storage levels, which default to MEMORY_ONLY.
18
​
19
void checkpoint()
20
​
21
Mark this Graph for checkpointing.
22
​
23
EdgeRDDImpl<ED,VD> edges()
24
​
25
An RDD containing the edges and their associated attributes.
26
​
27
static <VD,ED> GraphImpl<VD,ED> fromEdgePartitions(RDD<scala.Tuple2<Object,org.apache.spark.graphx.impl.EdgePartition<ED,VD>>> edgePartitions, VD defaultVertexAttr, StorageLevel edgeStorageLevel, StorageLevel vertexStorageLevel, scala.reflect.ClassTag<VD> evidence$15, scala.reflect.ClassTag<ED> evidence$16)
28
​
29
Create a graph from EdgePartitions, setting referenced vertices to defaultVertexAttr.
30
​
31
static <VD,ED> GraphImpl<VD,ED> fromExistingRDDs(VertexRDD<VD> vertices, EdgeRDD<ED> edges, scala.reflect.ClassTag<VD> evidence$21, scala.reflect.ClassTag<ED> evidence$22)
32
​
33
Create a graph from a VertexRDD and an EdgeRDD with the same replicated vertex type as the vertices.
34
​
35
scala.collection.Seq<String> getCheckpointFiles()
36
Gets the name of the files to which this Graph was checkpointed.
37
Graph<VD,ED> groupEdges(scala.Function2<ED,ED,ED> merge)
38
​
39
Merges multiple edges between two vertices into a single edge.
40
​
41
boolean isCheckpointed()
42
​
43
Return whether this Graph has been checkpointed or not.
44
​
45
<ED2> Graph<VD,ED2> mapEdges(scala.Function2<Object,scala.collection.Iterator<Edge<ED>>,scala.collection.Iterator<ED2>> f, scala.reflect.ClassTag<ED2> evidence$6)
46
​
47
Transforms each edge attribute using the map function, passing it a whole partition at a time.
48
​
49
<ED2> Graph<VD,ED2> mapTriplets(scala.Function2<Object,scala.collection.Iterator<EdgeTriplet<VD,ED>>,scala.collection.Iterator<ED2>> f, TripletFields tripletFields, scala.reflect.ClassTag<ED2> evidence$7)
50
​
51
Transforms each edge attribute a partition at a time using the map function, passing it the adjacent vertex attributes as well.
52
​
53
<VD2> Graph<VD2,ED> mapVertices(scala.Function2<Object,VD,VD2> f, scala.reflect.ClassTag<VD2> evidence$5, scala.Predef.$eq$colon$eq<VD,VD2> eq)
54
​
55
Transforms each vertex attribute in the graph using the map function.
56
​
57
<VD2,ED2> Graph<VD,ED> mask(Graph<VD2,ED2> other, scala.reflect.ClassTag<VD2> evidence$8, scala.reflect.ClassTag<ED2> evidence$9)
58
​
59
Restricts the graph to only the vertices and edges that are also in other, but keeps the attributes from this graph.
60
​
61
<U,VD2> Graph<VD2,ED> outerJoinVertices(RDD<scala.Tuple2<Object,U>> other, scala.Function3<Object,VD,scala.Option<U>,VD2> updateF, scala.reflect.ClassTag<U> evidence$11, scala.reflect.ClassTag<VD2> evidence$12, scala.Predef.$eq$colon$eq<VD,VD2> eq)
62
​
63
Joins the vertices with entries in the table RDD and merges the results using mapFunc.
64
​
65
Graph<VD,ED> partitionBy(PartitionStrategy partitionStrategy)
66
​
67
Repartitions the edges in the graph according to partitionStrategy.
68
​
69
Graph<VD,ED> partitionBy(PartitionStrategy partitionStrategy, int numPartitions)
70
​
71
Repartitions the edges in the graph according to partitionStrategy.
72
​
73
Graph<VD,ED> persist(StorageLevel newLevel)
74
​
75
Caches the vertices and edges associated with this graph at the specified storage level, ignoring any target storage levels previously set.
76
org.apache.spark.graphx.impl.ReplicatedVertexView<VD,ED> replicatedVertexView()
77
​
78
Graph<VD,ED> reverse()
79
​
80
Reverses all edges in the graph.
81
​
82
Graph<VD,ED> subgraph(scala.Function1<EdgeTriplet<VD,ED>,Object> epred, scala.Function2<Object,VD,Object> vpred)
83
​
84
Restricts the graph to only the vertices and edges satisfying the predicates.
85
RDD<EdgeTriplet<VD,ED>> triplets()
86
​
87
Return an RDD that brings edges together with their source and destination vertices.
88
Graph<VD,ED> unpersist(boolean blocking)
89
​
90
Uncaches both vertices and edges of this graph.
91
​
92
Graph<VD,ED> unpersistVertices(boolean blocking)
93
​
94
Uncaches only the vertices of this graph, leaving the edges alone.
95
VertexRDD<VD> vertices()
96
​
97
An RDD containing the vertices and their associated attributes.
98
​
99
Methods inherited from class org.apache.spark.graphx.Graph
100
​
101
aggregateMessages, fromEdges, fromEdgeTuples, graphToGraphOps, mapEdges, mapTriplets, mapTriplets, ops
102
​
103
Methods inherited from class Object
104
​
105
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Copied!
​
Last modified 1yr ago
Copy link