You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@spark.apache.org by "Liang-Chi Hsieh (JIRA)" <ji...@apache.org> on 2015/02/26 15:27:05 UTC

[jira] [Created] (SPARK-6041) Compute shortest path for graph with edge distances

Liang-Chi Hsieh created SPARK-6041:
--------------------------------------

             Summary: Compute shortest path for graph with edge distances
                 Key: SPARK-6041
                 URL: https://issues.apache.org/jira/browse/SPARK-6041
             Project: Spark
          Issue Type: Improvement
          Components: GraphX
            Reporter: Liang-Chi Hsieh
            Priority: Minor


Add the function to compute shortest path for graph with edge distances.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org