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.
Kyle
