Algorithmsmedium

Bellman–Ford: when do you use it and what extra capability does it have over Dijkstra?

Answer

Use Bellman–Ford when you have negative edge weights. It can detect negative cycles by doing one extra relaxation round. The trade‑off is slower time complexity: O(V·E).

Related questions

Algorithms

A* search: how does the heuristic affect optimality?

#a-star#heuristic#shortest-path

Algorithms

What does the Floyd–Warshall algorithm compute and what is its complexity?

#graphs#shortest-path#floyd-warshall

Algorithms

Kruskal vs Prim for MST — how do they differ?

#mst#kruskal#prim

Algorithms

A* vs Dijkstra — what’s the difference and when is A* faster?

#a-star#dijkstra#heuristics

Algorithms

Why doesn’t Dijkstra work with negative edge weights, and what can you use instead?

#dijkstra#bellman-ford#negative-weights

Algorithms

When can BFS replace Dijkstra’s algorithm?

#shortest-path#bfs#dijkstra