[
https://issues.apache.org/jira/browse/FLINK-6393?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15987983#comment-15987983
]
Greg Hogan commented on FLINK-6393:
-----------------------------------
Hi [~fanzhidongyzby], we'll leave this Jira open until the pull request is
merged into the repository.
I looked for a description of this graph early today and the closest I could
find was [CirculantGraph|http://mathworld.wolfram.com/CirculantGraph.html],
which is a generalization. What algorithms would use the EvenlyGraph?
> 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)
