Bellman–Ford algorithm (Q816022)

From Wikidata
Jump to: navigation, search
algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
  • Bellman–Ford–Moore algorithm
edit
Language Label Description Also known as
English
Bellman–Ford algorithm
algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
  • Bellman–Ford–Moore algorithm

Statements

0 references
0 references

Identifiers