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 --------------------------------------------------------------------- To unsubscribe, e-mail: user-unsubscr...@spark.apache.org For additional commands, e-mail: user-h...@spark.apache.org
