flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF GitHub Bot (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (FLINK-2634) Add a Vertex-centric Version of the Tringle Count Library Method
Date Sat, 12 Sep 2015 21:16:45 GMT

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

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

Github user andralungu commented on the pull request:

    https://github.com/apache/flink/pull/1105#issuecomment-139820404
  
    If it's okay with you, I'd like to see what @vasia has to say about adding the Triangle
Count example from the DataSet API +  a reduce as a library method. IMO, it's a better addition,
but for some reason, we preferred the Pregel/GSA implementations at a certain point (it was
because in my thesis, I take Pregel as a baseline). 
    
    Also the generic K instead of Long makes perfect sense. However, if we decide to change
it, I'll have to open a JIRA to revise the entire set of library methods because apart from
PageRank, I think they all restrict themselves to one common key type. I would be kind of
scared of type erasure in the K implements Key case :-S 


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

Mime
View raw message