[jira] [Commented] (FLINK-2634) Add a Vertex-centric Version of the Tringle Count Library Method

["ASF GitHub Bot (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/FLINK-2634?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14734716#comment-14734716 ] 

ASF GitHub Bot commented on FLINK-2634:
---------------------------------------

GitHub user andralungu opened a pull request:

    https://github.com/apache/flink/pull/1105

    [FLINK-2634] [gelly] Added a vertex-centric Triangle Count Lib Method

    This PR adds a vertex centric version of the TriangleCount algorithm as discussed in #1054. 
    
    The main difference is that the reduceOn* calls have been replaced with groupReduceOn* calls.
    
    Depending on the input graph, one may need to use the GAS version (skewed networks) or the vertex-centric version.  

You can merge this pull request into a Git repository by running:

    $ git pull https://github.com/andralungu/flink tcVertexCentric

Alternatively you can review and apply these changes as the patch at:

    https://github.com/apache/flink/pull/1105.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 #1105
    
----
commit 6f24c6918d7de4cd5c8fdced7248836a4704ceb3
Author: Andra Lungu <lu...@gmail.com>
Date:   2015-09-08T12:15:23Z

    [FLINK-2634] [gelly] Added a vertex-centric Triangle Count Library Method

----


> 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)