Bellman-Ford algorithm

名词 n.
中文释义

英文释义

名词 n.
  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.

词形变化

Bellman-Ford algorithms plural

词源

Named after its developers, Richard Bellman and L. R. Ford, Jr.
0 次浏览 数据来源: Wiktionary