Bellman-Ford algorithm (English, noun)
expansion: Bellman-Ford algorithm (plural Bellman-Ford algorithms)
Senses:
topics: computing
engineering
graph-theory
mathematics
natural-sciences
physical-sciences
sciences
glosses: An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.
Forms:
form: Bellman-Ford algorithms
tags: plural