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

Graph algorithms for vertex and edge degree

    XMLWordPrintableJSON

Details

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

    Description

      Many graph algorithms require vertices or edges to be marked with the degree. This ticket provides algorithms for annotating

      • vertex degree for undirected graphs
      • vertex out-, in-, and out- and in-degree for directed graphs
      • edge source, target, and source and target degree for undirected graphs

      Attachments

        Issue Links

          is depended upon by

          New Feature - A new feature of the product, which has yet to be developed. FLINK-3768 Clustering Coefficient

          • Major - Major loss of function.
          • Closed

          New Feature - A new feature of the product, which has yet to be developed. FLINK-3780 Jaccard Similarity

          • Major - Major loss of function.
          • Closed

          Activity

            People

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

              Dates

                Created:
                Updated:
                Resolved: