[
https://issues.apache.org/jira/browse/FLINK-2150?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14579556#comment-14579556
]
ASF GitHub Bot commented on FLINK-2150:
---------------------------------------
Github user andralungu commented on the pull request:
https://github.com/apache/flink/pull/801#issuecomment-110502315
Hi @fhueske ,
To tell the truth, I was a bit reserved regarding your approach, so maybe
we can discuss it a bit further! :) I updated the PR to contain what I
understood should be done[Tell me if I got it right!].
Now the question is: what happens when you have more than 63 partitions?
When you shift, won't you overcome Long 's bounds?
> Add a library method that assigns unique Long values to vertices
> ----------------------------------------------------------------
>
> Key: FLINK-2150
> URL: https://issues.apache.org/jira/browse/FLINK-2150
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Reporter: Vasia Kalavri
> Assignee: Andra Lungu
> Priority: Minor
> Labels: starter
>
> In some graph algorithms, it is required to initialize the vertex values with
> unique values (e.g. label propagation).
> This issue proposes adding a Gelly library method that receives an input
> graph and initializes its vertex values with unique Long values.
> This method can then also be used to improve the MusicProfiles example.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
