I meant to ask whether it gives the solution faster than other algorithms. What do you mean by distributed algorithms? Can we not use any algorithm on a distributed environment?
Thank You On Tue, Nov 18, 2014 at 3:41 PM, Ankur Dave <ankurd...@gmail.com> wrote: > 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 faster distributed algorithms for > single-source shortest paths, but I'm not familiar with them. As far as I > can tell, distributed Bellman-Ford is the most widely-used one. > > Ankur >
