GitHub user ankurdave opened a pull request:
https://github.com/apache/spark/pull/3619
[SPARK-4763] All-pairs shortest paths algorithm for GraphX
Computes unweighted all-pairs shortest paths, returning an RDD containing
the shortest-path distance between all pairs of reachable vertices. The
algorithm is similar to distance-vector routing and runs in `O(|V|)` iterations.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/ankurdave/spark
SPARK-4763-all-pairs-shortest-paths
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/3619.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 #3619
----
commit b69cffbc831ae79d1f5b56713ff839f80ba0caaa
Author: Ankur Dave <[email protected]>
Date: 2014-12-05T10:01:34Z
Checkpoint every 25 iterations in Pregel
commit 0c0e18465b871d97ddf0b11d86c3462147d45fb7
Author: Ankur Dave <[email protected]>
Date: 2014-12-05T10:00:49Z
Add AllPairsShortestPaths and unit test
----
---
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]
