I'm trying to test some graph operations I've written using GraphX. To make sure I catch all appropriate test cases, I'm trying to specify an input graph that is partitioned a specific way.
Unfortunately, it seems graphx.Graph repartitions and shuffles any input
node and edge RDD I give it.
Is there a way to construct a graph so that it uses the partitions given
and doesn't shuffle everything around?
Thanks,
-Nathan Kronenfeld
