[
https://issues.apache.org/jira/browse/FLINK-6393?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15986453#comment-15986453
]
FlorianFan edited comment on FLINK-6393 at 4/27/17 12:17 PM:
-------------------------------------------------------------
[~greghogan]]
Yeah, this is really interesting ! The core idea is based on the concept of
central symmetry. From the view of any vertex in the graph, the other vertices
and edges are the same. So in the intermediate cases, edges are created from
one vertex to the opposite vertex(if exists) and vertices on both sides of it.
The algorithm has been implemented, I'm now writing unit test case of it and
will send post request soon.
was (Author: fanzhidongyzby):
[~fhueske]
Yeah, this is really interesting ! The core idea is based on the concept of
central symmetry. From the view of any vertex in the graph, the other vertices
and edges are the same. So in the intermediate cases, edges are created from
one vertex to the opposite vertex(if exists) and vertices on both sides of it.
The algorithm has been implemented, I'm now writing unit test case of it and
will send post request soon.
> 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)
