Mailing-List: contact issues-help@flink.apache.org; run by ezmlm
Precedence: bulk
Reply-To: dev@flink.apache.org
Date: Mon, 14 Sep 2015 16:25:45 +0000 (UTC)
From: "ASF GitHub Bot (JIRA)" <jira@apache.org>
To: issues@flink.apache.org
Message-ID: <JIRA.12862384.1441710837000.331494.1442247945954@Atlassian.JIRA>
In-Reply-To: <JIRA.12862384.1441710837000@Atlassian.JIRA>
References: <JIRA.12862384.1441710837000@Atlassian.JIRA>
 <JIRA.12862384.1441710837406@arcas>
Subject: [jira] [Commented] (FLINK-2634) Add a Vertex-centric Version of the
 Tringle Count Library Method
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit


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

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

Github user andralungu commented on the pull request:

    https://github.com/apache/flink/pull/1105#issuecomment-140133538
  
    Hey you two :)
    
    I suggest that we add this one. 
    Let the JIRA that @vasia opened handle the keys.
    Then add the DataSet example (another JIRA) and a JIRA for benchmarks.
    
    I think that would more or less make everyone happy. 


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