[
https://issues.apache.org/jira/browse/FLINK-3772?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15273983#comment-15273983
]
ASF GitHub Bot commented on FLINK-3772:
---------------------------------------
Github user greghogan commented on the pull request:
https://github.com/apache/flink/pull/1901#issuecomment-217428888
@vasia I had looked at one of the failed tests and it wasn't due to bad
logic but rather to running out of some minimal number of memory buffers. This
results, I expect, from updating the `Graph` API's degree functions to
translate the output of the degree algorithms. I think it is best to leave the
`Graph` API as-is for now.
> 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)
