[
https://issues.apache.org/jira/browse/FLINK-2714?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14952245#comment-14952245
]
ASF GitHub Bot commented on FLINK-2714:
---------------------------------------
Github user vasia commented on the pull request:
https://github.com/apache/flink/pull/1250#issuecomment-147178962
Hi @ssaumitra! Thanks a lot for the pull request, it looks good.
I was thinking, since this algorithm not only counts but actually
enumerates all triangles, we could have 2 library methods, `TriangleCounter`
and `TriangleEnumerator`. They would basically use the same algorithm
internally, but the first would return the number of triangles, while the
second would return a `DataSet` of `Tuple3`, containing the vertex IDs that
form triangles. What do you think?
> Port the Flink DataSet Triangle Count example to the Gelly library
> ------------------------------------------------------------------
>
> Key: FLINK-2714
> URL: https://issues.apache.org/jira/browse/FLINK-2714
> Project: Flink
> Issue Type: Task
> Components: Gelly
> Affects Versions: 0.10
> Environment:
> Reporter: Andra Lungu
> Assignee: Saumitra Shahapure
> Priority: Trivial
> Labels: newbie, starter
>
> Currently, the Gelly library contains two methods for counting the number of
> triangles in a graph: a vertex-centric version and a gather-apply-scatter
> version.
> This issue proposes the addition of a third library method based on this
> Flink example:
> https://github.com/apache/flink/blob/master/flink-examples/flink-java-examples/src/main/java/org/apache/flink/examples/java/graph/EnumTrianglesOpt.java
> The only modification needed is an extra reduce step that takes the
> enumerated triangles produced and yields a number.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
