[
https://issues.apache.org/jira/browse/SPARK-1159?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Andres Perez updated SPARK-1159:
--------------------------------
Description:
Add a landmark-based shortest-path computation to org.apache.spark.graphx.lib,
to gather the lengths of shortest paths to a given set of nodes across the
whole graph.
See PR: https://github.com/apache/spark/pull/10
was:
Add a landmark-based shortest-path computation to org.apache.spark.graphx.lib,
to gather the lengths of shortest paths to a given set of nodes across the
whole graph. If we add a dependency on algebird to store a map of VertexId to
Min[Int] for keeping the shortest path distances, the updating of the shortest
paths is very simple using a map monoid.
See PR: https://github.com/apache/spark/pull/10
> Add Shortest-path computations to graphx.lib
> --------------------------------------------
>
> Key: SPARK-1159
> URL: https://issues.apache.org/jira/browse/SPARK-1159
> Project: Spark
> Issue Type: New Feature
> Reporter: Andres Perez
> Priority: Minor
>
> Add a landmark-based shortest-path computation to
> org.apache.spark.graphx.lib, to gather the lengths of shortest paths to a
> given set of nodes across the whole graph.
> See PR: https://github.com/apache/spark/pull/10
--
This message was sent by Atlassian JIRA
(v6.2#6252)
