I apologize in advance if the answer to this question is obvious, but here
goes ...
The GraphX merge and reduction functions take two objects of type A and
return one object of type A. Is there a nice, efficient way to implement a
reduction function like median or mode? These reduction functions
Are these incremental reduction functions what you'd expect when a graph is
partitioned using vertex cuts? You'd naturally want to consolidate the
versions of a vertex's state inside partitions, then across partitions.
--
View this message in context:
http://apache-spark-user-list.1001560.n3.