[
https://issues.apache.org/jira/browse/FLINK-2634?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14969754#comment-14969754
]
ASF GitHub Bot commented on FLINK-2634:
---------------------------------------
GitHub user andralungu opened a pull request:
https://github.com/apache/flink/pull/1291
[FLINK-2634] [gelly] [WIP] Vertex Centric Triangle Count
This PR builds on the code presented in #1105.
Basically, the reduceOn* calls are replaced with groupReduceOn* calls.
As discussed back then, I made the lib method accept any kind of keys.
While doing so, I found a bit of a bug (which is why I marked this as WIP). The
groupReduceOnNeighbors function has a version that takes a type argument. The
problem with that is: coGroup tries to build a type before the call to
`returns()` which means that it cannot infer the type from the info it has.
I'll explain this a bit better in a Jira.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/andralungu/flink trianglecount-vertexcentric
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/flink/pull/1291.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #1291
----
commit 1fbc09ca35e80f61f31cf7a6166f27f2a6f142c1
Author: andralungu <[email protected]>
Date: 2015-10-22T06:18:43Z
[FLINK-2634] [gelly] Vertex Centric Triangle Count
[FLINK-2634] [gelly] Fixed Type Erasure
----
> 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)
