[
https://issues.apache.org/jira/browse/FLINK-2570?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Andra Lungu updated FLINK-2570:
-------------------------------
Description:
The Gather-Sum-Apply-Scatter 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.
Gather: no-op
Sum: create a set out of these neighbours
Apply: attach the computed values to the vertices
2). Propagate each received value to neighbours with higher id (again using GSA)
3). Compute the number of Triangles by verifying if the final vertex contains
the sender's id in its list.
> Add a Triangle Count Library Method
> -----------------------------------
>
> Key: FLINK-2570
> URL: https://issues.apache.org/jira/browse/FLINK-2570
> Project: Flink
> Issue Type: Task
> Components: Gelly
> Affects Versions: 0.10
> Reporter: Andra Lungu
> Assignee: Andra Lungu
> Priority: Minor
>
> The Gather-Sum-Apply-Scatter 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.
> Gather: no-op
> Sum: create a set out of these neighbours
> Apply: attach the computed values to the vertices
> 2). Propagate each received value to neighbours with higher id (again using
> GSA)
> 3). Compute the number of Triangles by verifying if the final vertex contains
> the sender's id in its list.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
