aboutsummaryrefslogtreecommitdiff
path: root/docs/bagel-programming-guide.md
diff options
context:
space:
mode:
authorMatei Zaharia <matei@eecs.berkeley.edu>2012-09-20 17:35:10 -0700
committerMatei Zaharia <matei@eecs.berkeley.edu>2012-09-20 17:35:10 -0700
commitbf891a5c18342c01b2065c4cd41fd96df11ebd7d (patch)
tree981b078c390d01d1413532191a23ba7f8c2e45c8 /docs/bagel-programming-guide.md
parent1c3d3f4e8cc66e740109eb8eafc95c99f23e4a2c (diff)
parentc94e9cc54aebddc20cc4ab13ca106781c7298642 (diff)
downloadspark-bf891a5c18342c01b2065c4cd41fd96df11ebd7d.tar.gz
spark-bf891a5c18342c01b2065c4cd41fd96df11ebd7d.tar.bz2
spark-bf891a5c18342c01b2065c4cd41fd96df11ebd7d.zip
Merge pull request #203 from JoshRosen/docs/java-programming-guide
Java Programming Guide
Diffstat (limited to 'docs/bagel-programming-guide.md')
-rw-r--r--docs/bagel-programming-guide.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/bagel-programming-guide.md b/docs/bagel-programming-guide.md
index b133376a97..0c925c176c 100644
--- a/docs/bagel-programming-guide.md
+++ b/docs/bagel-programming-guide.md
@@ -19,7 +19,7 @@ To write a Bagel application, you will need to add Spark, its dependencies, and
## Programming Model
-Bagel operates on a graph represented as a [distributed dataset]({{HOME_PATH}}programming-guide.html) of (K, V) pairs, where keys are vertex IDs and values are vertices plus their associated state. In each superstep, Bagel runs a user-specified compute function on each vertex that takes as input the current vertex state and a list of messages sent to that vertex during the previous superstep, and returns the new vertex state and a list of outgoing messages.
+Bagel operates on a graph represented as a [distributed dataset]({{HOME_PATH}}scala-programming-guide.html) of (K, V) pairs, where keys are vertex IDs and values are vertices plus their associated state. In each superstep, Bagel runs a user-specified compute function on each vertex that takes as input the current vertex state and a list of messages sent to that vertex during the previous superstep, and returns the new vertex state and a list of outgoing messages.
For example, we can use Bagel to implement PageRank. Here, vertices represent pages, edges represent links between pages, and messages represent shares of PageRank sent to the pages that a particular page links to.