It looks like to be similar (simpler) to the connected component implementation in GraphX. Have you checked that ?
I have questions though, in your example, the graph is a tree. What is the behavior if it is a more general graph ? Cheers, Anwar Rizal. On Mon, Jan 12, 2015 at 1:02 AM, dizzy5112 <dave.zee...@gmail.com> wrote: > Hi all looking for some help in propagating some values in edges. What i > want > to achieve (see diagram) is for each connected part of the graph assign an > incrementing value for each of the out links from the root node. This > value > will restart again for the next part of the graph. ie node 1 has out links > to node 2,3,and 4. The edge attribute for these will be 1,2 and 3 > respectively. For each of the out links from these nodes they keep this > value right through to the final node in their path. For node 9 with out > link to 10 this has an edge attribute of 1 etc etc. Thanks in advance for > any help :) dave > > < > http://apache-spark-user-list.1001560.n3.nabble.com/file/n21086/Drawing2.jpg > > > > > > > -- > View this message in context: > http://apache-spark-user-list.1001560.n3.nabble.com/propogating-edges-tp21086.html > Sent from the Apache Spark User List mailing list archive at Nabble.com. > > --------------------------------------------------------------------- > To unsubscribe, e-mail: user-unsubscr...@spark.apache.org > For additional commands, e-mail: user-h...@spark.apache.org > >
