Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[SPARK-6455] [docs] Correct some mistakes and typos #5128

Closed
wants to merge 3 commits into from
Closed

[SPARK-6455] [docs] Correct some mistakes and typos #5128

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
206f2dc
Correct some mistakes and typos.
Mar 22, 2015
67b77b5
[SPARK-6455] [docs] Correct some mistakes and typos
Mar 22, 2015
53e5432
Merge branch 'master' of https://github.com/yuhc/spark
Mar 22, 2015
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions graphx/src/main/scala/org/apache/spark/graphx/GraphOps.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -113,7 +113,7 @@ class GraphOps[VD: ClassTag, ED: ClassTag](graph: Graph[VD, ED]) extends Seriali
* Collect the neighbor vertex attributes for each vertex.
*
* @note This function could be highly inefficient on power-law
* graphs where high degree vertices may force a large ammount of
* graphs where high degree vertices may force a large amount of
* information to be collected to a single location.
*
* @param edgeDirection the direction along which to collect
Expand Down Expand Up @@ -187,7 +187,7 @@ class GraphOps[VD: ClassTag, ED: ClassTag](graph: Graph[VD, ED]) extends Seriali

/**
* Join the vertices with an RDD and then apply a function from the
* the vertex and RDD entry to a new vertex value. The input table
* vertex and RDD entry to a new vertex value. The input table
* should contain at most one entry for each vertex. If no entry is
* provided the map function is skipped and the old value is used.
*
Expand Down
4 changes: 2 additions & 2 deletions graphx/src/main/scala/org/apache/spark/graphx/Pregel.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -78,8 +78,8 @@ object Pregel extends Logging {
*
* @param graph the input graph.
*
* @param initialMsg the message each vertex will receive at the on
* the first iteration
* @param initialMsg the message each vertex will receive at the first
* iteration
*
* @param maxIterations the maximum number of iterations to run for
*
Expand Down
4 changes: 2 additions & 2 deletions graphx/src/main/scala/org/apache/spark/graphx/lib/PageRank.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,7 @@ import org.apache.spark.graphx._
/**
* PageRank algorithm implementation. There are two implementations of PageRank implemented.
*
* The first implementation uses the [[Pregel]] interface and runs PageRank for a fixed number
* The first implementation uses the standalone [[Graph]] interface and runs PageRank for a fixed number
* of iterations:
* {{{
* var PR = Array.fill(n)( 1.0 )
Expand All @@ -38,7 +38,7 @@ import org.apache.spark.graphx._
* }
* }}}
*
* The second implementation uses the standalone [[Graph]] interface and runs PageRank until
* The second implementation uses the [[Pregel]] interface and runs PageRank until
* convergence:
*
* {{{
Expand Down