The Bellman-Ford algorithm is designed to handle graphs with negative edge weights, unlike Dijkstra's algorithm, which cannot handle negative weights. Bellman-Ford can compute the shortest paths even if there are negative edges, as long as there are no negative weight cycles.