Alot of descriptions and stuff popped up there :-) All you want to keep in mind is that Dijkstra is quicker but does not handle negative weighted edges in the graph since it can't handle negative cycles. Bellman-Ford handles this at the cost of being a bit slower.
On Dec 14, 7:10 am, vicky <mehta...@gmail.com> wrote: > What is the difference between Dijkstra's algorithm and Bellman-Ford's > algorithm? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
