[
https://issues.apache.org/jira/browse/FLINK-6393?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15989289#comment-15989289
]
ASF GitHub Bot commented on FLINK-6393:
---------------------------------------
Github user greghogan commented on the issue:
https://github.com/apache/flink/pull/3788
@fanzhidongyzby that sounds good except I would leave the `EmptyGraph` as
it is. In addition we'll want to add the new generators as driver inputs in
`flink-gelly-examples`, add to the list of inputs in `Runner`, and add a test
each to `EdgeListITCase` (run the test to compute the checksum to create the
test string).
Also, on the graph name, without a reference to the literature, perhaps
this could be something invoking the idea that vertices are connected by
length-1 paths to "far" vertices, by length-2 paths to "near" vertices, by
length-3 paths to "far" vertices, etc. Something like `EchoGraph`.
> Add Evenly Graph Generator to Flink Gelly
> -----------------------------------------
>
> Key: FLINK-6393
> URL: https://issues.apache.org/jira/browse/FLINK-6393
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Reporter: FlorianFan
> Assignee: FlorianFan
> Priority: Minor
> Original Estimate: 24h
> Remaining Estimate: 24h
>
> Evenly graph means every vertex in the graph has the same degree, so the
> graph can be treated as evenly due to all the edges in the graph are
> distributed evenly. when vertex degree is 0, an empty graph will be
> generated. when vertex degree is vertex count - 1, complete graph will be
> generated.
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
