Tag: lester-ford

Bellman-Ford generalized shortest-path computation to weighted graphs with negative edges and added a decisive test for negative cycles, using repeated relaxation rather than a greedy frontier.