Bellman-Ford algorithm

Etymology
Named after its developers, and

Noun

 * 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.

Translations

 * Portuguese: algoritmo de Bellman-Ford