At 2014-11-17 14:47:50 +0530, Deep Pradhan pradhandeep1...@gmail.com wrote:
I was going through the graphx section in the Spark API in
https://spark.apache.org/docs/latest/api/scala/index.html#org.apache.spark.graphx.lib.ShortestPaths$
Here, I find the word landmark. Can anyone explain to me
So landmark can contain just one vertex right?
Which algorithm has been used to compute the shortest path?
Thank You
On Tue, Nov 18, 2014 at 2:53 PM, Ankur Dave ankurd...@gmail.com wrote:
At 2014-11-17 14:47:50 +0530, Deep Pradhan pradhandeep1...@gmail.com
wrote:
I was going through the
At 2014-11-18 14:59:20 +0530, Deep Pradhan pradhandeep1...@gmail.com wrote:
So landmark can contain just one vertex right?
Right.
Which algorithm has been used to compute the shortest path?
It's distributed Bellman-Ford.
Ankur
Does Bellman-Ford give the best solution?
On Tue, Nov 18, 2014 at 3:27 PM, Ankur Dave ankurd...@gmail.com wrote:
At 2014-11-18 14:59:20 +0530, Deep Pradhan pradhandeep1...@gmail.com
wrote:
So landmark can contain just one vertex right?
Right.
Which algorithm has been used to compute the
At 2014-11-18 15:29:08 +0530, Deep Pradhan pradhandeep1...@gmail.com wrote:
Does Bellman-Ford give the best solution?
It gives the same solution as any other algorithm, since there's only one
correct solution for shortest paths and it's guaranteed to find it eventually.
There are probably
At 2014-11-18 15:44:31 +0530, Deep Pradhan pradhandeep1...@gmail.com wrote:
I meant to ask whether it gives the solution faster than other algorithms.
No, it's just that it's much simpler and easier to implement than the others.
Section 5.2 of the Pregel paper [1] justifies using it for a graph
Hi,
I was going through the graphx section in the Spark API in
https://spark.apache.org/docs/latest/api/scala/index.html#org.apache.spark.graphx.lib.ShortestPaths$
Here, I find the word landmark. Can anyone explain to me what is landmark
means. Is it a simple English word or does it mean
