diff options
author | Ankur Dave <ankurdave@gmail.com> | 2014-01-13 16:15:10 -0800 |
---|---|---|
committer | Ankur Dave <ankurdave@gmail.com> | 2014-01-13 17:03:03 -0800 |
commit | 1bd5cefcae2769d48ad5ef4b8197193371c754da (patch) | |
tree | 8248ab428af3a76b89f4cfbe526a839a31284d81 /docs | |
parent | e2d25d2dfeb1d43d1e36f169250d8efef4ac232a (diff) | |
download | spark-1bd5cefcae2769d48ad5ef4b8197193371c754da.tar.gz spark-1bd5cefcae2769d48ad5ef4b8197193371c754da.tar.bz2 spark-1bd5cefcae2769d48ad5ef4b8197193371c754da.zip |
Remove aggregateNeighbors
Diffstat (limited to 'docs')
-rw-r--r-- | docs/graphx-programming-guide.md | 17 |
1 files changed, 0 insertions, 17 deletions
diff --git a/docs/graphx-programming-guide.md b/docs/graphx-programming-guide.md index 002ba0cf73..e6afd092be 100644 --- a/docs/graphx-programming-guide.md +++ b/docs/graphx-programming-guide.md @@ -519,23 +519,6 @@ val avgAgeOlderFollowers: VertexRDD[Double] = > are constant sized (e.g., floats and addition instead of lists and concatenation). More > precisely, the result of `mapReduceTriplets` should be sub-linear in the degree of each vertex. -Because it is often necessary to aggregate information about neighboring vertices we also provide an -alternative interface defined in [`GraphOps`][GraphOps]: - -{% highlight scala %} -def aggregateNeighbors[A]( - map: (VertexID, EdgeTriplet[VD, ED]) => Option[A], - reduce: (A, A) => A, - edgeDir: EdgeDirection) - : VertexRDD[A] -{% endhighlight %} - -The `aggregateNeighbors` operator is implemented directly on top of `mapReduceTriplets` but allows -the user to define the logic in a more vertex centric manner. Here the `map` function is provided -the vertex to which the message is sent as well as one of the edges and returns the optional message -value. The `edgeDir` determines whether the `map` function is run on `In`, `Out`, or `All` edges -adjacent to each vertex. - ### Computing Degree Information A common aggregation task is computing the degree of each vertex: the number of edges adjacent to |