Q816022

From Wikidata
Jump to: navigation, search

Bellman–Ford algorithm(Q816022)

an algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
    No aliases defined.
[edit]
Language Label Description Also known as
English
Bellman–Ford algorithm
an algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative

    Statements

    0 references
    0 references
    /m/01g933
    1 reference