[ https://issues.apache.org/jira/browse/FLINK-3772?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15245532#comment-15245532 ]
Vasia Kalavri commented on FLINK-3772: -------------------------------------- Hi [~greghogan], I'm a bit skeptical about adding such algorithms. Currently, one can easily get the vertex or edge set annotated with degrees using Gelly's {{getDegrees}}, {{inDegrees}}, {{outDegrees}} and {{joinWithVertices}}, {{joinWithEdges}} methods. Do we really need dedicated methods for this? > 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)