GitHub user daijidj opened a pull request:
https://github.com/apache/spark/pull/17822
[SPARK-20454] [GraphX] Two Improvements of ShortestPaths in GraphX
I made two improvements as follows, we can have broader usage on
shortest paths.
(1) Output multiple shortest paths if there are. It computes shortest
paths from a given source vertex to all other vertices. If several
paths have the same shortest distance between two vertices, all the
paths will be outputted.
(2) Support both weighted and unweighted graphs. The generalized
problem is weighted graph, and it is what my code works on. You just
need to input the weighted graph as âtrueâ in the parameters. It can
also address the unweighted graph. If you input an unweighted graph, I
just set the weights of each edge as 1.
The contribution is my original work and that I license the work to the
project under the projectâs open source license.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/daijidj/spark master
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/17822.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 #17822
----
----
---
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]
