TERMIUM Plus®

From: Translation Bureau

On social media

Consult the Government of Canada’s terminology data bank.

BELLMAN-FORD ALGORITHM [1 record]

Filter results by subject field Alphabetical list of terms

Filter results by subject field

Alphabetical list of terms

Record 1 2019-10-30

English

Subject field(s)
  • Computer Mathematics
  • Computer Programs and Programming
DEF

An algorithm that computes [the] paths from a single source vertex to all of the other vertices in a weighted digraph.

French

Domaine(s)
  • Mathématiques informatiques
  • Programmes et programmation (Informatique)
CONT

L'algorithme de Bellman-Ford résout le problème des plus courts chemins avec origine unique dans le cas le plus général où les poids des arcs peuvent avoir des valeurs négatives.

Spanish

Campo(s) temático(s)
  • Matemáticas para computación
  • Programas y programación (Informática)
CONT

El algoritmo Bellman-Ford es un algoritmo que calcula los caminos más cortos de una sola fuente vértice a todos los otros vértices en un dígrafo ponderado.

Save record 1

Copyright notice for the TERMIUM Plus® data bank

© Public Services and Procurement Canada, 2026
TERMIUM Plus®, the Government of Canada's terminology and linguistic data bank
A product of the Translation Bureau

Display options

Change the order of display of the official languages of Canada
Option to display the non-official languages (Spanish or Portuguese)
Display definitions, contexts, etc., on records

Features

GCtranslate (available on the Government of Canada network only)

Use this artificial intelligence prototype to translate Government of Canada content up to and including Protected B. Available to employees of selected departments and agencies only.

Writing tools

The Language Portal’s writing tools have a new look! Easy to consult, they give you access to a wealth of information that will help you write better in English and French.

Glossaries and vocabularies

Access Translation Bureau glossaries and vocabularies.

Date Modified: