[jira] [Commented] (FLINK-3772) Graph algorithms for vertex and edge degree

["Greg Hogan (JIRA)" <ji...@apache.org>]

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

Greg Hogan commented on FLINK-3772:
-----------------------------------

I added documentation and removed algorithm caching, the latter because I think we do better by merging configurations.

> Graph algorithms for vertex and edge degree
> -------------------------------------------
>
>                 Key: FLINK-3772
>                 URL: https://issues.apache.org/jira/browse/FLINK-3772
>             Project: Flink
>          Issue Type: New Feature
>          Components: Gelly
>    Affects Versions: 1.1.0
>            Reporter: Greg Hogan
>            Assignee: Greg Hogan
>             Fix For: 1.1.0
>
>
> 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



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