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 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 something else in > graphx. > > The "landmarks" in the context of the shortest-paths algorithm are just > the vertices of interest. For each vertex in the graph, the algorithm will > return the distance to each of the "landmark" vertices. > > Ankur >
