[ https://issues.apache.org/jira/browse/FLINK-2909?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15198513#comment-15198513 ]
ASF GitHub Bot commented on FLINK-2909: --------------------------------------- GitHub user greghogan opened a pull request: https://github.com/apache/flink/pull/1807 [FLINK-2909] [Gelly] Graph generators Initial set of scale-free graph generators: - Complete graph - Cycle graph - Empty graph - Grid graph - Hypercube graph - Path graph - RMat graph - Singleton edge graph - Star graph You can merge this pull request into a Git repository by running: $ git pull https://github.com/greghogan/flink 2909_gelly_graph_generators Alternatively you can review and apply these changes as the patch at: https://github.com/apache/flink/pull/1807.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 #1807 ---- commit 4e6f552ae55c670c75541c133540193647ad4d4d Author: Greg Hogan <c...@greghogan.com> Date: 2016-03-15T20:57:37Z [FLINK-3589] Allow setting Operator parallelism to default value This is a temporary fix in place of [FLINK-3589]. commit 8a96fbf9193df6239586691e2196927a8c5f43b5 Author: Greg Hogan <c...@greghogan.com> Date: 2016-03-15T20:59:02Z [FLINK-2909] [Gelly] Graph Generators Initial set of scale-free graph generators: - Complete graph - Cycle graph - Empty graph - Grid graph - Hypercube graph - Path graph - RMat graph - Singleton edge graph - Star graph ---- > Gelly Graph Generators > ---------------------- > > Key: FLINK-2909 > URL: https://issues.apache.org/jira/browse/FLINK-2909 > Project: Flink > Issue Type: New Feature > Components: Gelly > Affects Versions: 1.0.0 > Reporter: Greg Hogan > Assignee: Greg Hogan > > Include a selection of graph generators in Gelly. Generated graphs will be > useful for performing scalability, stress, and regression testing as well as > benchmarking and comparing algorithms, for both Flink users and developers. > Generated data is infinitely scalable yet described by a few simple > parameters and can often substitute for user data or sharing large files when > reporting issues. > There are at multiple categories of graphs as documented by > [NetworkX|https://networkx.github.io/documentation/latest/reference/generators.html] > and elsewhere. > Graphs may be a well-defined, i.e. the [Chvátal > graph|https://en.wikipedia.org/wiki/Chv%C3%A1tal_graph]. These may be > sufficiently small to populate locally. > Graphs may be scalable, i.e. complete and star graphs. These should use > Flink's distributed parallelism. > Graphs may be stochastic, i.e. [RMat > graphs|http://snap.stanford.edu/class/cs224w-readings/chakrabarti04rmat.pdf] > . A key consideration is that the graphs should source randomness from a > seedable PRNG and generate the same Graph regardless of parallelism. -- This message was sent by Atlassian JIRA (v6.3.4#6332)