Q816022

From Wikidata
Jump to: navigation, search

Bellman–Ford algorithm (Q816022)[edit]

an algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative [edit]

No aliases defined. [add]

Statements

[edit]
0 references
[edit]
0 references
[add]
/m/01g933
[edit]
1 reference
[add]