Ok, thanks, just wanted to make sure I wasn't missing something obvious. I've worked with Neo4j cypher as well, where it was rather more obvious.
e.g. http://neo4j.com/docs/milestone/query-match.html#_shortest_path http://neo4j.com/docs/stable/cypher-refcard/ Dino. On 6 October 2015 at 06:43, Robineast [via Apache Spark User List] <ml-node+s1001560n24941...@n3.nabble.com> wrote: > GraphX doesn't implement Tinkerpop functionality but there is an external > effort to provide an implementation. See > https://issues.apache.org/jira/plugins/servlet/mobile#issue/SPARK-4279 > Robin East > Spark GraphX in Action Michael Malak and Robin East > Manning Publications Co. > http://www.manning.com/books/spark-graphx-in-action > > > ________________________________ > If you reply to this email, your message will be added to the discussion > below: > http://apache-spark-user-list.1001560.n3.nabble.com/GraphX-How-can-I-tell-if-2-nodes-are-connected-tp24926p24941.html > To unsubscribe from GraphX: How can I tell if 2 nodes are connected?, click > here. > NAML -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/GraphX-How-can-I-tell-if-2-nodes-are-connected-tp24926p24944.html Sent from the Apache Spark User List mailing list archive at Nabble.com.
