Anita Tailor created SPARK-10465: ------------------------------------ Summary: Shortest Path between two vertex, using distance and results carries shortest path and distance Key: SPARK-10465 URL: https://issues.apache.org/jira/browse/SPARK-10465 Project: Spark Issue Type: New Feature Components: GraphX Affects Versions: 1.4.1 Reporter: Anita Tailor Priority: Minor
Currently there is now API in graphX to calculate shortest path between two vertex based on edge weight and give Path ( vertex list ) as well in results Input should be - graph with edge weight, which will be used as distance metric - from vertex Id - to vertex Id Output - graph with following vertex attribute Map (Shortest Distance, List of Vertex in Shortest Path to "to Vertex Id" ) -- This message was sent by Atlassian JIRA (v6.3.4#6332) --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@spark.apache.org For additional commands, e-mail: issues-h...@spark.apache.org