Hello, I was wondering if there exists some elegant way to build a fully connected grid-graph. The standard grid-graph function only creates one, where a vertex is connected to the vertices of row+1 and column+1. I need for my algorithm that every vertex is connected to the vertices of row-1, row+1, column-1 and column+1.
I already searched a lot with google. Therefore, I hope somebody can give me a good hint. Thank you a lot in advance. Best regards, Benjamin -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/GraphX-Easy-way-to-build-fully-connected-grid-graph-tp26013.html Sent from the Apache Spark User List mailing list archive at Nabble.com. --------------------------------------------------------------------- To unsubscribe, e-mail: user-unsubscr...@spark.apache.org For additional commands, e-mail: user-h...@spark.apache.org
