Graph iteration with triplets or access to edges

[Kaepke, Marc]

Hi everyone,

in Gelly I use the Scatter-Gather Iteration to create clusters depends on edge-values.

During a superstep each vertex has to sum all edge values of its neighbors. The scatter and gather functions both works on one vertex.

How can I get the out and in-going edges of each vertex?
Or
Does the iterations works with triplets and if: how?


Best,
Marc

[Kaepke, Marc]

to summarize my question:
Does Flink or Gelly offers an access to the edges of a single vertex?
Or:
I need a VertexTriplet and not an EdgeTriplet (graph.getTriplets())

Thanks!
Best,
Marc

> Am 27.04.2017 um 20:20 schrieb Kaepke, Marc <[hidden email]>:
>
> Hi everyone,
>
> in Gelly I use the Scatter-Gather Iteration to create clusters depends on edge-values.
>
> During a superstep each vertex has to sum all edge values of its neighbors. The scatter and gather functions both works on one vertex.
>
> How can I get the out and in-going edges of each vertex?
> Or
> Does the iterations works with triplets and if: how?
>
>
> Best,
> Marc

[Vasiliki Kalavri]

Hi Marc,

you can access the edge values inside the ScatterFunction using the getEdges() method. For an example look at SingleSourceShortestPaths [1] which sums up edge values to compute distances.

I hope that helps!
-Vasia.

[1]: https://github.com/apache/flink/blob/master/flink-libraries/flink-gelly-examples/src/main/java/org/apache/flink/graph/examples/SingleSourceShortestPaths.java#L115

On 28 April 2017 at 12:38, Kaepke, Marc <[hidden email]> wrote:

to summarize my question:
Does Flink or Gelly offers an access to the edges of a single vertex?
Or:
I need a VertexTriplet and not an EdgeTriplet (graph.getTriplets())

Thanks!
Best,
Marc

> Am 27.04.2017 um 20:20 schrieb Kaepke, Marc <[hidden email]>:
>
> Hi everyone,
>
> in Gelly I use the Scatter-Gather Iteration to create clusters depends on edge-values.
>
> During a superstep each vertex has to sum all edge values of its neighbors. The scatter and gather functions both works on one vertex.
>
> How can I get the out and in-going edges of each vertex?
> Or
> Does the iterations works with triplets and if: how?
>
>
> Best,
> Marc