You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@flink.apache.org by "Vasia Kalavri (JIRA)" <ji...@apache.org> on 2016/05/11 15:10:14 UTC
[jira] [Closed] (FLINK-2634) Add a Vertex-centric Version of the
Tringle Count Library Method
[ https://issues.apache.org/jira/browse/FLINK-2634?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Vasia Kalavri closed FLINK-2634.
--------------------------------
Resolution: Won't Fix
There is currently no need or demand for this version. The current TriangleEnumerator cover this functionality.
> 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.0
> 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)