[
https://issues.apache.org/jira/browse/FLINK-2634?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14740840#comment-14740840
]
ASF GitHub Bot commented on FLINK-2634:
---------------------------------------
Github user fhueske commented on the pull request:
https://github.com/apache/flink/pull/1105#issuecomment-139553246
I did not go through the code in detail. Maybe I am missing something, but
isn't this algorithm doing pretty much the same thing as the example we have
already for the DataSet API examples (Java + Scala). In the existing examples
(EnumTrianglesOpt) 3 reduce and 1 join to enumerate all triangles. We would
need one more reduce to compute the number of triangles which makes 4 reduce
and 1 join.
In your code you are using 5 reduce and 2 joins if I counted correctly.
Are those two algorithms doing different things or could you basically port
the existing code to Gelly?
> Add a Vertex-centric Version of the Tringle Count Library Method
> ----------------------------------------------------------------
>
> Key: FLINK-2634
> URL: https://issues.apache.org/jira/browse/FLINK-2634
> Project: Flink
> Issue Type: Task
> Components: Gelly
> Affects Versions: 0.10
> Reporter: Andra Lungu
> Assignee: Andra Lungu
> Priority: Minor
>
> The vertex-centric 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.
> 2). Propagate each received value to neighbours with higher id.
> 3). Compute the number of Triangles by verifying if the final vertex contains
> the sender's id in its list.
> As opposed to the GAS version, all these three steps will be performed via
> message passing.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
