[
https://issues.apache.org/jira/browse/FLINK-1514?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14366041#comment-14366041
]
ASF GitHub Bot commented on FLINK-1514:
---------------------------------------
Github user vasia commented on the pull request:
https://github.com/apache/flink/pull/408#issuecomment-82588861
Hi @balidani, thanks a lot for the changes! I'll try to run some tests on a
cluster soon and test the new version.
I have a question about the graph coloring example. As far as I understand,
in this algorithm, colors are represented by numbers (vertex values) and the
goal is to color the graph with the minimum number of colors, so that no 2
neighboring vertices have the same color. So, in each superstep, each vertex
gathers the colors of its neighbors in a set and then assigns itself the
minimum color that isn't in this set. However, it seems to me that in your
implementation, you're only propagating the minimum neighbor value, similar to
what you would do in connected components. Is there anything I'm missing here?
Thanks!
> [Gelly] Add a Gather-Sum-Apply iteration method
> -----------------------------------------------
>
> Key: FLINK-1514
> URL: https://issues.apache.org/jira/browse/FLINK-1514
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 0.9
> Reporter: Vasia Kalavri
> Assignee: Daniel Bali
>
> This will be a method that implements the GAS computation model, but without
> the "scatter" step. The phases can be mapped into the following steps inside
> a delta iteration:
> gather: a map on each < srcVertex, edge, trgVertex > that produces a partial
> value
> sum: a reduce that combines the partial values
> apply: join with vertex set to update the vertex values using the results of
> sum and the previous state.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
