Thanks for the suggestions,
Yes I believe Ali is also looking for a more straight forward approach to
access the degree of a vertex (i.e without creating a new dataset).
But Martin and Vasias suggestions will work, so thanks again
On Tue, May 30, 2017 at 10:44 AM, Nico Kruber
wrote:
> Does Mar
Does Martin's answer to a similar thread help?
https://lists.apache.org/thread.html/
000af2fb17a883b60f4a2359ebbeca42e3160c2167a88995c2ee28c2@
%3Cuser.flink.apache.org%3E
On Monday, 29 May 2017 19:38:20 CEST Martin Junghanns wrote:
> Hi Ali :)
>
> You could compute the degrees beforehand (e.g. u
Hi all,
I have a question related to Gelly and graph filtering and hoping to get
some pointers/input.
Basically I have a bipartite graph prepared for a signal/collect iteration,
but want to prune it first to only include target nodes with x or more
edges (indegree >= x). To filter on vertex value
