Uploaded image for project: 'Flink'
  1. Flink
  2. FLINK-3907

Directed Clustering Coefficient

    XMLWordPrintableJSON

Details

    • New Feature
    • Status: Closed
    • Major
    • Resolution: Fixed
    • 1.1.0
    • 1.1.0
    • Library / Graph Processing
    • None

    Description

      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.

      Attachments

        Issue Links

          depends upon

          New Feature - A new feature of the product, which has yet to be developed. FLINK-4013 GraphAlgorithms to simplify directed and undirected graphs

          • Minor - Minor loss of function, or other problem where easy workaround is present.
          • Closed

          Improvement - An improvement or enhancement to an existing feature or task. FLINK-3945 Degree annotation for directed graphs

          • Minor - Minor loss of function, or other problem where easy workaround is present.
          • Closed
          links to

          Web Link GitHub Pull Request #2079

          Activity

            People

              greghogan Greg Hogan
              greghogan Greg Hogan
              Votes:
              0 Vote for this issue
              Watchers:
              2 Start watching this issue

              Dates

                Created:
                Updated:
                Resolved: