Re: counting degrees graphx

2014-05-26 Thread daze5112
that is brilliant Ankur, thanks so much for your help! -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/counting-degrees-graphx-tp6370p6409.html Sent from the Apache Spark User List mailing list archive at Nabble.com.

Re: counting degrees graphx

2014-05-26 Thread Ankur Dave
On closer inspection it looks like Map normally is serializable, and it's just a bug in mapValues, so I changed to using the .map(identity) workaround described in https://issues.scala-lang.org/browse/SI-7005. Ankur

Re: counting degrees graphx

2014-05-26 Thread Ankur Dave
s? > > thanks > > > > -- > View this message in context: > http://apache-spark-user-list.1001560.n3.nabble.com/counting-degrees-graphx-tp6370p6405.html > Sent from the Apache Spark User List mailing list archive at Nabble.com. >

Re: counting degrees graphx

2014-05-26 Thread daze5112
: scala.collection.immutable.MapLike$$anon$2 any ideas? thanks -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/counting-degrees-graphx-tp6370p6405.html Sent from the Apache Spark User List mailing list archive at Nabble.com.

Re: counting degrees graphx

2014-05-26 Thread Ankur Dave
OK, here's some code to do this using the GraphX Pregel API: https://gist.github.com/ankurdave/4a17596669b36be06100 Ankur

Re: counting degrees graphx

2014-05-25 Thread dizzy5112
sorry directions of edges in this image <http://apache-spark-user-list.1001560.n3.nabble.com/file/n6384/image1.jpg> -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/counting-degrees-graphx-tp6370p6384.html Sent from the Apache Spark User List mailin

Re: counting degrees graphx

2014-05-25 Thread dizzy5112
and 7 are level 0, verices 2,3,and and are level 1, vertices 4 and 5 are level 2 (5 is also a level 1 when looked at through vertice 6). Hope that is clearer. cheers -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/counting-degrees-graphx-tp6370p6383.htm

Re: counting degrees graphx

2014-05-25 Thread ankurdave
Sorry, I missed vertex 6 in that example. It should be [{1}, {1}, {1}, {1}, {1, 6}, {6}, {7}, {7}]. -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/counting-degrees-graphx-tp6370p6378.html Sent from the Apache Spark User List mailing list archive at

Re: counting degrees graphx

2014-05-25 Thread Ankur Dave
I'm not sure I understand what you're looking for. Could you provide some more examples to clarify? One interpretation is that you want to tag the source vertices in a graph (those with zero indegree) and find for each vertex the set of sources that lead to that vertex. For vertices 1-8 in the gra

counting degrees graphx

2014-05-25 Thread dizzy5112
ives me two clusters with the root nodes for each as ID 1 and ID 7. what i really want to do is identify the third cluster that is built into this graph (the connection between 106 and 105 as another cluster. My results would identify that 105 was in cluster 1 and the new cluster. any help appreci