THE LIVING ARCHIVE

From punched cards to autonomous collaborators: the ideas, people, languages and systems that taught machines to follow—and increasingly interpret—human intent.

PAST / PRESENT / NEXT

Collection

Tag: shortest-paths

Bellman-Ford and Shortest Paths with Negative Edge Weights

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.

↗