[FLINK-3772] [gelly] Graph algorithms for vertex and edge degree #1901
Conversation
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
This is an optimization for VertexDegreePair which need only perform a single join and for the edge annotations which do not need zero degree vertices.
for algorithms which, for example, use an edge weight.
greghogan
force-pushed
the
3772_graph_algorithms_for_vertex_and_edge_degree
branch
from
66f6f0e to
3126efd
Compare
greghogan
force-pushed
the
3772_graph_algorithms_for_vertex_and_edge_degree
branch
from
57ff7e4 to
45c4724
Compare
docs/apis/batch/libs/gelly.md
Outdated
| <td><strong>TranslateGraphIds</strong></td> | ||
| <td>degree.annotate.directed.<br/><strong>VertexInDegree</strong></td> | ||
| <td> | ||
| <p>Annotate vertices of a directed graph with the in-degree count.</p> |
There was a problem hiding this comment.
What do you mean by in-degree "count"? What's the result of this operation?
There was a problem hiding this comment.
I am removing "count" from the descriptions since "degree" implies a count.
|
@greghogan, after your last commit, there are several gelly test cases failing on travis. Could you please take a look? Thanks! |
|
@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 |
|
I've only left a minor comment @greghogan, otherwise I think it's good to merge. |
|
Merging ... |
|
Closed in 70181b2 |
3 participants
Graph algorithms for annotating