Yes I was looking something of that sort.. Thank you. Actually I was looking for a way to connect nodes based on the property of the nodes.. I have a set of nodes and I know the condition on which I can create an edge.. On 11 Jan 2016 14:06, "Robin East" <robin.e...@xense.co.uk> wrote:
> Do you mean to create a perfect graph? You can do it like this: > > scala> import org.apache.spark.graphx._ > import org.apache.spark.graphx._ > > scala> val vert = sc.parallelize(Seq(1L,2L,3L,4L,5L)) > vert: org.apache.spark.rdd.RDD[Long] = ParallelCollectionRDD[23] at > parallelize at <console>:36 > > scala> val edges = vert.cartesian(vert) > edges: org.apache.spark.rdd.RDD[(Long, Long)] = CartesianRDD[24] at > cartesian at <console>:38 > > scala> val g = Graph.fromEdgeTuples(edges, 1) > > > That will give you a graph where all vertices connect to every other > vertices. it will give you self joins as well i.e. vert 1 has an edge to > vert 1, you can deal with this using a filter on the edges RDD if you don’t > want self-joins > > ------------------------------------------------------------------------------ > Robin East > *Spark GraphX in Action* Michael Malak and Robin East > Manning Publications Co. > http://www.manning.com/books/spark-graphx-in-action > > > > > > On 11 Jan 2016, at 03:19, praveen S <mylogi...@gmail.com> wrote: > > Is it possible in graphx to create/generate graph of n x n given only the > vertices. > On 8 Jan 2016 23:57, "praveen S" <mylogi...@gmail.com> wrote: > >> Is it possible in graphx to create/generate a graph n x n given n >> vertices? >> > >