[
https://issues.apache.org/jira/browse/FLINK-4934?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15622433#comment-15622433
]
ASF GitHub Bot commented on FLINK-4934:
---------------------------------------
GitHub user greghogan opened a pull request:
https://github.com/apache/flink/pull/2731
[FLINK-4934] [gelly] Triadic Census
A triad is any three vertices in a graph. The triadic census produces
counts for each of the 4 undirected and 16 directed triad types.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/greghogan/flink 4934_triadic_census
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/flink/pull/2731.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #2731
----
----
> Triadic Census
> --------------
>
> Key: FLINK-4934
> URL: https://issues.apache.org/jira/browse/FLINK-4934
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 1.2.0
> Reporter: Greg Hogan
> Assignee: Greg Hogan
>
> A triad is any three vertices in a graph. An undirected graph has 4 types of
> triads (with 0, 1, 2, or 3 edges among the three vertices) and a directed
> graph has 16 types
> (http://vlado.fmf.uni-lj.si/pub/networks/doc/triads/triads.pdf).
> This can be implemented as an analytic. The undirected implementation will
> use {{VertexMetrics}} and {{TriangleCount}}. The directed implementation will
> use {{VertexDegrees}} and {{TriangleListing}} with postprocessing.
> This could be added to the {{TriangleListing}} driver in Gelly examples.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
