flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From vasia <...@git.apache.org>
Subject [GitHub] flink pull request: [FLINK-1514][Gelly] Add a Gather-Sum-Apply ite...
Date Tue, 17 Mar 2015 20:41:29 GMT
Github user vasia commented on the pull request:

    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?

If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastructure@apache.org or file a JIRA ticket
with INFRA.

View raw message