diff options
Diffstat (limited to 'docs/graphx-programming-guide.md')
| -rw-r--r-- | docs/graphx-programming-guide.md | 21 |
1 files changed, 17 insertions, 4 deletions
diff --git a/docs/graphx-programming-guide.md b/docs/graphx-programming-guide.md index ed976b8989..002ba0cf73 100644 --- a/docs/graphx-programming-guide.md +++ b/docs/graphx-programming-guide.md @@ -464,10 +464,10 @@ PageRank Value, shortest path to the source, and smallest reachable vertex id). ### Map Reduce Triplets (mapReduceTriplets) <a name="mrTriplets"></a> -[Graph.mapReduceTriplets]: api/graphx/index.html#mapReduceTriplets[A](mapFunc:org.apache.spark.graphx.EdgeTriplet[VD,ED]=>Iterator[(org.apache.spark.graphx.VertexID,A)],reduceFunc:(A,A)=>A,activeSetOpt:Option[(org.apache.spark.graphx.VertexRDD[_],org.apache.spark.graphx.EdgeDirection)])(implicitevidence$10:scala.reflect.ClassTag[A]):org.apache.spark.graphx.VertexRDD[A] +[Graph.mapReduceTriplets]: api/graphx/index.html#org.apache.spark.graphx.Graph@mapReduceTriplets[A](mapFunc:org.apache.spark.graphx.EdgeTriplet[VD,ED]=>Iterator[(org.apache.spark.graphx.VertexID,A)],reduceFunc:(A,A)=>A,activeSetOpt:Option[(org.apache.spark.graphx.VertexRDD[_],org.apache.spark.graphx.EdgeDirection)])(implicitevidence$10:scala.reflect.ClassTag[A]):org.apache.spark.graphx.VertexRDD[A] -These core (heavily optimized) aggregation primitive in GraphX is the -(`mapReduceTriplets`)[Graph.mapReduceTriplets] operator: +The core (heavily optimized) aggregation primitive in GraphX is the +[`mapReduceTriplets`][Graph.mapReduceTriplets] operator: {% highlight scala %} def mapReduceTriplets[A]( @@ -476,7 +476,7 @@ def mapReduceTriplets[A]( : VertexRDD[A] {% endhighlight %} -The (`mapReduceTriplets`)[Graph.mapReduceTriplets] operator takes a user defined map function which +The [`mapReduceTriplets`][Graph.mapReduceTriplets] operator takes a user defined map function which is applied to each triplet and can yield *messages* destined to either (none or both) vertices in the triplet. We currently only support messages destined to the source or destination vertex of the triplet to enable optimized preaggregation. The user defined `reduce` function combines the @@ -659,6 +659,19 @@ val sssp = initialGraph.pregel(Double.PositiveInfinity)( # Graph Builders <a name="graph_builders"></a> +[`GraphLoader.edgeListFile`][GraphLoader.edgeListFile] + +[`Graph.apply`][Graph.apply] + +[`Graph.fromEdgeTuples`][Graph.fromEdgeTuples] + +[`Graph.fromEdges`][Graph.fromEdges] + +[GraphLoader.edgeListFile]: api/graphx/index.html#org.apache.spark.graphx.GraphLoader$@edgeListFile(SparkContext,String,Boolean,Int):Graph[Int,Int] +[Graph.apply]: api/graphx/index.html#org.apache.spark.graphx.Graph$@apply[VD,ED](RDD[(VertexID,VD)],RDD[Edge[ED]],VD)(ClassTag[VD],ClassTag[ED]):Graph[VD,ED] +[Graph.fromEdgeTuples]: api/graphx/index.html#org.apache.spark.graphx.Graph$@fromEdgeTuples[VD](RDD[(VertexID,VertexID)],VD,Option[PartitionStrategy])(ClassTag[VD]):Graph[VD,Int] +[Graph.fromEdges]: api/graphx/index.html#org.apache.spark.graphx.Graph$@fromEdges[VD,ED](RDD[Edge[ED]],VD)(ClassTag[VD],ClassTag[ED]):Graph[VD,ED] + # Vertex and Edge RDDs <a name="vertex_and_edge_rdds"></a> |