You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@flink.apache.org by "ASF GitHub Bot (JIRA)" <ji...@apache.org> on 2016/04/17 01:39:25 UTC
[jira] [Commented] (FLINK-3772) Graph algorithms for vertex and
edge degree
[ https://issues.apache.org/jira/browse/FLINK-3772?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15244470#comment-15244470 ]
ASF GitHub Bot commented on FLINK-3772:
---------------------------------------
GitHub user greghogan opened a pull request:
https://github.com/apache/flink/pull/1901
[FLINK-3772] [gelly] Graph algorithms for vertex and edge degree
Graph 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
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/greghogan/flink 3772_graph_algorithms_for_vertex_and_edge_degree
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/flink/pull/1901.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #1901
----
commit 6a19cd62e4556d8b0d0a688eceee1788a0dd4054
Author: Greg Hogan <co...@greghogan.com>
Date: 2016-04-16T14:30:58Z
[FLINK-3772] [gelly] Graph algorithms for vertex and edge degree
Graph 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
----
> 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)