Bellman-ford-algorithm meaning

(graph theory) 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.
noun
0
0
Advertisement

Origin of bellman-ford-algorithm

  • Named after its developers, Richard Bellman and L. R. Ford, Jr.

    From Wiktionary