Bellman-Ford algorithm
Description: A graph algorithm for finding shortest paths from a single source, including in graphs with edges of negative weight.
Primary topic: Complexity and Algorithms in Graphs (31%)
Wikidata ID: wiki/Q816022
OpenAlex ID: keywords/bellman-ford-algorithm
