[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-30 Thread Xingcan Cui (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Xingcan Cui commented on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 
Hi Vasia Kalavri, thanks for your explanation. I got the problem. It seems that Flink still lack a cache() like method for its Dataset and that's why during each iteration the job can only run from the very beginning. As you said before, we really can implement the algorithm without an intermediate result cache support (maybe move all steps to a single vertex-centric iteration and store the edge values in vertices). However, the codes will be ugly then and that must not be a good "example" for the Gelly lib. Therefore, I'm afraid the issue should be shelved again until the underlayer provide more supportive. What do you think? As for the "no value updates", it comes from https://ci.apache.org/projects/flink/flink-docs-release-1.2/dev/libs/gelly/iterative_graph_processing.html. I think it's better to give a more clear explanation of the end conditions for each kind of iteration. Sorry for making bold.  
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-30 Thread Vasia Kalavri (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Vasia Kalavri commented on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 
Hi Xingcan Cui, the problem is that currently you cannot have an iteration (e.g. vertex-centric) inside a for-loop or a while-loop. So, your pseudocode won't work (well, it will, but only for very small inputs). I believe "no value updates" refers to no vertex values changing. Where did you see this? 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-30 Thread Xingcan Cui (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Xingcan Cui edited a comment on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 Hi [~vkalavri],actually, I am a new comer and have no idea about the "for-loop iteration". IMO, the vertex centric iteration is enough.Here is a brief description of the algorithm.{code}While the graph.edges is not empty   Find the min-edges for each vertices  Decide and propagate super vertices using runVertexCentricIteration   Put the chosen edges to the result set  Shrink the graph and remove "inner" edges and verticesReturn the result set{code}I'm not sure if there exist some barriers since I have not finished it yet.BTW, I have a question about the end condition of iterations. What does "the algorithm converges when there are *no value updates*" mean? Thanks. 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-30 Thread Xingcan Cui (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Xingcan Cui commented on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 
Hi Vasia Kalavri, actually, I am a new comer and have no idea about the "for-loop iteration". IMO, the vertex centric iteration is enough. Here is a brief description of the algorithm. 

 

While the graph.edges is not empty 
  Find the min-edges for each vertices
  Decide and propagate super vertices using runVertexCentricIteration 
  Put the chosen edges to the result set
  Shrink the graph and remove "inner" edges and vertices
Return the result set
 

 
I'm not sure if there exist some barriers since I have not finished it yet. BTW, I have a question about the end condition of iterations. What does "the algorithm converges when there are no value updates" mean? 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-29 Thread Vasia Kalavri (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Vasia Kalavri commented on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 
Hi Xingcan Cui, thank you for your interest in this issue. As you can see in the comments history, contributors have had problems completing this task without support for for-loop iterations. Are you planning to take a different approach? Could you describe how you're planning to proceed? Thanks! 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-29 Thread Robert Metzger (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Robert Metzger commented on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 
Hi, I gave you contributor permissions in our JIRA and assigned this one to you. 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-29 Thread Robert Metzger (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Robert Metzger assigned an issue to Xingcan Cui 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 Flink /  FLINK-1526 
 
 
 
  Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 

Change By:
 
 Robert Metzger 
 
 
 

Assignee:
 
 Xingcan Cui 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-29 Thread Xingcan Cui (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Xingcan Cui edited a comment on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 Hi,I am working on this issue. Can anybody assign it  for  to  me? Thanks. 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d) 
 
 
 
 
  
 
 
 
 
 
 
 
 
   



[jira] (FLINK-1526) Add Minimum Spanning Tree library method and example

2017-01-29 Thread Xingcan Cui (JIRA)
Title: Message Title
 
 
 
 
 
 
 
 
 
 
  
 
 Xingcan Cui commented on  FLINK-1526 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
  Re: Add Minimum Spanning Tree library method and example  
 
 
 
 
 
 
 
 
 
 
Hi, I am working on this issue. Can anybody assign it for me? Thanks. 
 
 
 
 
 
 
 
 
 
 
 
 

 
 Add Comment 
 
 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 

 This message was sent by Atlassian JIRA (v6.3.15#6346-sha1:dbc023d)