[
https://issues.apache.org/jira/browse/FLINK-2570?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14712565#comment-14712565
]
ASF GitHub Bot commented on FLINK-2570:
---------------------------------------
Github user vasia commented on the pull request:
https://github.com/apache/flink/pull/1054#issuecomment-134847237
I think you should wait a bit. There is an open discussion in the mailing
list on whether to fork 0.9.1 out of the current master. If there is consensus
and you merge this, then this will be one more change to revert (even though
this is not API breaking, but it's new functionality, so I'm not really sure).
> Add a Triangle Count Library Method
> -----------------------------------
>
> Key: FLINK-2570
> URL: https://issues.apache.org/jira/browse/FLINK-2570
> Project: Flink
> Issue Type: Task
> Components: Gelly
> Affects Versions: 0.10
> Reporter: Andra Lungu
> Assignee: Andra Lungu
> Priority: Minor
>
> The Gather-Sum-Apply-Scatter version of this algorithm receives an undirected
> graph as input and outputs the total number of triangles formed by the
> graph's edges.
> The implementation consists of three phases:
> 1). Select neighbours with id greater than the current vertex id.
> Gather: no-op
> Sum: create a set out of these neighbours
> Apply: attach the computed values to the vertices
> 2). Propagate each received value to neighbours with higher id (again using
> GSA)
> 3). Compute the number of Triangles by verifying if the final vertex contains
> the sender's id in its list.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
