[
https://issues.apache.org/jira/browse/FLINK-3772?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15263993#comment-15263993
]
Greg Hogan commented on FLINK-3772:
-----------------------------------
There is am impedance mismatch between the algorithms and `Graph` methods. The
algorithms return datasets of `Vertex` and `Edge` whereas the `Graph` methods
return `Tuple2` and `Tuple3`. Also, the algorithms use mutable value types
whereas the `Graph` methods use immutable boxed types.
It's trivial to convert the existing `Graph` methods using this PR, the four
utility mapping functions, and a translator. I think adding to the current API
is another discussion.
> 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)
