GitHub user anitaguavus opened a pull request:
https://github.com/apache/spark/pull/8625
[SPARK-10465] Shortest Path between two vertices, using distance and â¦
â¦results carries shortest path and distance
Many Networking use cases requires computing shortest path between a pair
of vertices and
return list of vertices in shortets path as result with shortest distance.
Added API to solve above use case. This API considers edge attribute as
distance to
compute shortest path
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/anitaguavus/spark master
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/8625.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #8625
----
commit 5f4fa3534a0ba1c1038abe2c5326a25fd864ef83
Author: anita.tailor <[email protected]>
Date: 2015-09-06T15:08:35Z
[SPARK-10465] Shortest Path between two vertices, using distance and
results carries shortest path and distance
Many Networking use cases requires computing shortest path between a pair
of vertices and
return list of vertices in shortets path as result with shortest distance.
Added API to solve above use case. This API considers edge attribute as
distance to
compute shortest path
----
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
