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 shortest path? > > It's distributed Bellman-Ford. > > Ankur >
