Bellman-Ford algorithm

短语

词形变化

Bellman-Ford algorithms 复数 Bellman-Ford algorithms

释义与例句

n.
  1. 1.

    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.

    计算机 工程 数学

词源

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

来源：wiktionary