What is the most efficient way to an RDD of GraphX vertices and their
connected edges? Initially I though I could use mapReduceTriplet, but I
realized that would neglect vertices that aren't connected to anything
Would I have to do a mapReduceTriplet and then do a join with all of the
vertices
if possible.
Ankur http://www.ankurdave.com/
On Fri, May 2, 2014 at 11:34 AM, Kyle Ellrott kellr...@soe.ucsc.edu wrote:
What is the most efficient way to an RDD of GraphX vertices and their
connected edges?
