GitHub user kj-ki opened a pull request:
https://github.com/apache/spark/pull/3950
[SPARK-5064][GraphX] Add numEdges upperbound validation for R-MAT graph
generator to prevent infinite loop
I looked into GraphGenerators#chooseCell, and found that chooseCell can't
generate more edges than pow(2, (2 * (log2(numVertices)-1))) to make a
Power-law graph. (Ex. numVertices:4 upperbound:4, numVertices:8 upperbound:16,
numVertices:16 upperbound:64)
If we request more edges over the upperbound, rmatGraph fall into infinite
loop. So, how about adding an argument validation?
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/kj-ki/spark SPARK-5064
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/3950.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #3950
----
commit d760bc74aa92987837509c24a834f456b60fb096
Author: Kenji Kikushima <kikushima.ke...@lab.ntt.co.jp>
Date: 2015-01-08T13:05:01Z
Add numEdges upperbound validation for R-MAT graph generator to prevent
infinite loop.
----
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastruct...@apache.org or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: reviews-unsubscr...@spark.apache.org
For additional commands, e-mail: reviews-h...@spark.apache.org
