Bellman-ford

The Bellmanâ€“Ford algorithm computes single-source shortest paths in a weighted digraph

Dijkstra

Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra is a graph search algorithm that solves the single-source shortest path problem for a connected graph with nonnegative edge path costs, producing a shortest path tree

Circumstances situation approach

Quality | Example |
---|---|

Approach better |
"Surely there is some situation in which the bellman-ford approach is better than the dijkstra approach" from question "Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?" |

Better |
"But under what circumstances is the bellman-ford algorithm better than the dijkstra algorithm" from question "Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?" |

Better choice |
"However if g is guaranteed to have only non-negative weights g is non-positive weights then dijkstra s algorithm could be better choice over bellman-ford" from question "Dijkstra for longest path in a DAG" |

Others