[
https://issues.apache.org/jira/browse/FLINK-2634?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14904631#comment-14904631
]
ASF GitHub Bot commented on FLINK-2634:
---------------------------------------
Github user vasia commented on the pull request:
https://github.com/apache/flink/pull/1105#issuecomment-142635727
Hi @andralungu,
if you're not planning to continue on this PR, then I believe you should
close it. However, you might want to keep your local branch, in case someone
else wants to pick up where you left.
This is not an urgent issue, it's a nice-to-have feature, so you can come
back to it later :)
If you think that it might take too much time, then it might also be a good
idea to un-assign the JIRA.
Thanks!
> 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)
