spark-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Kyle Ellrott <>
Subject GraphX vertices and connected edges
Date Fri, 02 May 2014 18:34:53 GMT
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 to pick up the ones lost because there aren't part of a triplet?
I'm hoping there is a simpler way I've neglected.


View raw message