incubator-tinkerpop git commit: updated the docs to state that the MapReduce.map() vertex does not contain edges.

[ok...@apache.org]

Repository: incubator-tinkerpop
Updated Branches:
  refs/heads/master 7fbb33dcf -> 1a628ad24


updated the docs to state that the MapReduce.map() vertex does not contain edges.


Project: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/commit/1a628ad2
Tree: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/tree/1a628ad2
Diff: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/diff/1a628ad2

Branch: refs/heads/master
Commit: 1a628ad24d38e3b42e19ccb800b284c6a30e080f
Parents: 7fbb33d
Author: Marko A. Rodriguez <ok...@gmail.com>
Authored: Mon Apr 6 09:52:41 2015 -0600
Committer: Marko A. Rodriguez <ok...@gmail.com>
Committed: Mon Apr 6 09:52:41 2015 -0600

----------------------------------------------------------------------
 docs/src/the-graphcomputer.asciidoc | 2 ++
 1 file changed, 2 insertions(+)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/blob/1a628ad2/docs/src/the-graphcomputer.asciidoc
----------------------------------------------------------------------
diff --git a/docs/src/the-graphcomputer.asciidoc b/docs/src/the-graphcomputer.asciidoc
index b5d37e2..dc5a26b 100644
--- a/docs/src/the-graphcomputer.asciidoc
+++ b/docs/src/the-graphcomputer.asciidoc
@@ -71,6 +71,8 @@ public interface MapReduce<MK, MV, RK, RV, R> {
   // there are more methods
 }
 
+IMPORTANT: The vertex that is passed into the `MapReduce.map()` method does not contain edges. The vertex only contains original and computed vertex properties. This reduces the amount of data required to be loaded and ensures that MapReduce is used for post-processing computed results. All edge-based computing should be accomplished in the `VertexProgram`.
+
 image::mapreduce.png[width=650]
 
 The `MapReduce` extension to GraphComputer is made explicit when examining the <<peerpressurevertexprogram,`PeerPressureVertexProgram`>> and corresponding `ClusterPopulationMapReduce`. In the code below, the GraphComputer result returns the computed on `Graph` as well as the `Memory` of the computation (`ComputerResult`). The memory maintain the results of any MapReduce jobs. The cluster population MapReduce result states that there are 5 vertices in cluster 1 and 1 vertex in cluster 6. This can be verified (in a serial manner) by looking at the `PeerPressureVertexProgram.CLUSTER` property of the resultant graph. Notice that the property is "hidden" unless it is directly accessed via name.