You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@flink.apache.org by "Greg Hogan (JIRA)" <ji...@apache.org> on 2016/05/18 16:42:13 UTC

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

     [ https://issues.apache.org/jira/browse/FLINK-3772?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Greg Hogan closed FLINK-3772.
-----------------------------

> 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)