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.
    [edit]

    Statements

    0 references
    0 references
    /m/01g933
    1 reference