[ 
https://issues.apache.org/jira/browse/SPARK-20454?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
 ]

Ji Dai updated SPARK-20454:
---------------------------
    Description: 
The output of ShortestPaths is not enough. ShortestPaths in Graph/lib is 
currently in a simple version and can only return the distance to the source 
vertex. However, the shortest path with intermediate nodes on the path is 
needed and if two or more paths holds the same shortest distance from source to 
destination, all these paths need to be returned. In this way, ShortestPaths 
will be more functional and useful.

I think I have resolved the concern above with a improved version of 
ShortestPaths which also based on the "pregel" function in GraphOps.

Can I get my code reviewed and merged?

  was:
The output of ShortestPaths is not enough. ShortestPaths in Graph/lib is 
currently in a simple version and can only return the distance to the source 
vertex. However, the shortest path is needed and if two or more paths holds the 
same shortest distance from source to destination, all these paths need to be 
returned.

I think I have resolved the concern above with a improved version of 
ShortestPaths which also based on the "pregel" function in GraphOps.

Can I get my code reviewed and merged?


> Improvement of ShortestPaths in Spark GraphX
> --------------------------------------------
>
>                 Key: SPARK-20454
>                 URL: https://issues.apache.org/jira/browse/SPARK-20454
>             Project: Spark
>          Issue Type: Improvement
>          Components: GraphX, MLlib
>    Affects Versions: 2.1.0
>            Reporter: Ji Dai
>              Labels: patch
>
> The output of ShortestPaths is not enough. ShortestPaths in Graph/lib is 
> currently in a simple version and can only return the distance to the source 
> vertex. However, the shortest path with intermediate nodes on the path is 
> needed and if two or more paths holds the same shortest distance from source 
> to destination, all these paths need to be returned. In this way, 
> ShortestPaths will be more functional and useful.
> I think I have resolved the concern above with a improved version of 
> ShortestPaths which also based on the "pregel" function in GraphOps.
> Can I get my code reviewed and merged?



--
This message was sent by Atlassian JIRA
(v6.3.15#6346)

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

Reply via email to