spark-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From pwend...@apache.org
Subject [29/50] git commit: Minor changes in graphx programming guide.
Date Tue, 14 Jan 2014 06:59:53 GMT
Minor changes in graphx programming guide.


Project: http://git-wip-us.apache.org/repos/asf/incubator-spark/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-spark/commit/622b7f7d
Tree: http://git-wip-us.apache.org/repos/asf/incubator-spark/tree/622b7f7d
Diff: http://git-wip-us.apache.org/repos/asf/incubator-spark/diff/622b7f7d

Branch: refs/heads/master
Commit: 622b7f7d391375cced8633e4a2546dbca60a3907
Parents: 1dce9ce
Author: Joseph E. Gonzalez <joseph.e.gonzalez@gmail.com>
Authored: Mon Jan 13 17:46:47 2014 -0800
Committer: Joseph E. Gonzalez <joseph.e.gonzalez@gmail.com>
Committed: Mon Jan 13 18:40:43 2014 -0800

----------------------------------------------------------------------
 docs/graphx-programming-guide.md | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/incubator-spark/blob/622b7f7d/docs/graphx-programming-guide.md
----------------------------------------------------------------------
diff --git a/docs/graphx-programming-guide.md b/docs/graphx-programming-guide.md
index c82c3d7..c6505d2 100644
--- a/docs/graphx-programming-guide.md
+++ b/docs/graphx-programming-guide.md
@@ -543,7 +543,6 @@ val maxOutDegree: (VertexID, Int) = graph.outDegrees.reduce(max)
 val maxDegrees: (VertexID, Int)   = graph.degrees.reduce(max)
 {% endhighlight %}
 
-
 ### Collecting Neighbors
 
 In some cases it may be easier to express computation by collecting neighboring vertices
and their
@@ -562,8 +561,8 @@ def collectNeighbors(edgeDirection: EdgeDirection): VertexRDD[ Array[(VertexID,
 # Pregel API
 <a name="pregel"></a>
 
-Graphs are inherently recursive data-structures as properties of a vertices depend on properties
of
-their neighbors which intern depend on properties of the neighbors of their neighbors.  As
a
+Graphs are inherently recursive data-structures as properties of vertices depend on properties
of
+their neighbors which intern depend on properties of *their* neighbors.  As a
 consequence many important graph algorithms iteratively recompute the properties of each
vertex
 until a fixed-point condition is reached.  A range of graph-parallel abstractions have been
proposed
 to express these iterative algorithms.  GraphX exposes a Pregel operator which is a fusion
of


Mime
View raw message