[
https://issues.apache.org/jira/browse/FLINK-2570?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14711865#comment-14711865
]
ASF GitHub Bot commented on FLINK-2570:
---------------------------------------
Github user vasia commented on the pull request:
https://github.com/apache/flink/pull/1054#issuecomment-134720344
Thanks for the clarifications Andra! Everything looks good to me now.
I would love to also see a PR of the other implementation. And if you have
any insight on which one performs better when, then we should add this as a tip
to the descriptions.
> 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)
