[jira] [Commented] (FLINK-3907) Directed Clustering Coefficient

["ASF GitHub Bot (JIRA)" <ji...@apache.org>]

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

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

GitHub user greghogan opened a pull request:

    https://github.com/apache/flink/pull/2079

    [FLINK-3907] [gelly] Directed Clustering Coefficient

    

You can merge this pull request into a Git repository by running:

    $ git pull https://github.com/greghogan/flink 3907_directed_clustering_coefficient

Alternatively you can review and apply these changes as the patch at:

    https://github.com/apache/flink/pull/2079.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 #2079
    
----
commit a4ff0b99d91f607d49803ce213a0bca1cff7e279
Author: Greg Hogan <co...@greghogan.com>
Date:   2016-05-25T10:41:12Z

    [FLINK-3907] [gelly] Directed Clustering Coefficient

----


> Directed Clustering Coefficient
> -------------------------------
>
>                 Key: FLINK-3907
>                 URL: https://issues.apache.org/jira/browse/FLINK-3907
>             Project: Flink
>          Issue Type: New Feature
>          Components: Gelly
>    Affects Versions: 1.1.0
>            Reporter: Greg Hogan
>            Assignee: Greg Hogan
>
> A directed clustering coefficient algorithm can be implemented using an efficient triangle listing implementation which emits not only the three vertex IDs forming the triangle but also a bitmask indicating which edges form the triangle. A triangle can be formed with a minimum of three or maximum of six directed edges. Directed clustering coefficient can then shatter the triangles and emit a score of either 1 or 2 for each vertex.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)