Exactly :) That's why we haven't added neither the spanning tree nor the
strongly connected components algorithms yet.
On Sep 22, 2016 12:16 PM, "Stephan Ewen" wrote:
> Just as a general comment:
>
> A program with nested loops is most likely not going to be performant on
> any way. It makes sen
Just as a general comment:
A program with nested loops is most likely not going to be performant on
any way. It makes sense to re-think the algorithm, come up with a modified
or different pattern, rather than trying to implement the exact algorithm
line by line.
It may be worth checking that, bec
Hi Olga,
when you use mapEdges() or mapVertices() with generics, Flink cannot
determine the type because of type erasure, like the exception says. That's
why we also provide methods that take the type information as a parameter.
You can use those to make the return type explicit. In your example,
Hi Vasia,
I have uploaded these tests on github:
https://github.com/OlgaGolovneva/MST/tree/master/tests
I have also uploaded source code, but I'm still working on it:
https://github.com/OlgaGolovneva/MST/tree/master/src
>I think you cannot add attachments to the mailing list. Could you upload
>
Hi Olga,
On 21 September 2016 at 18:50, Olga Golovneva wrote:
> Hi devs,
>
> I was working on (FLINK-1526) "Add Minimum Spanning Tree library method
> and example" issue. I've developed (Java) code that implements distributed
> Boruvka's algorithm in Gelly library. I've run several tests and it
Hi devs,
I was working on (FLINK-1526) "Add Minimum Spanning Tree library method
and example" issue. I've developed (Java) code that implements distributed
Boruvka's algorithm in Gelly library. I've run several tests and it seems
to work fine, although I didn't test it on extremely large input gr
