Bellman-Ford algorithm

English

Etymology

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

Noun

Bellman-Ford algorithm (plural Bellman-Ford algorithms)

  1. (graph theory, computing) 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.

Translations

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.