Q1047576

From Wikidata
Jump to: navigation, search

Floyd–Warshall algorithm(Q1047576)

algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
    No aliases defined.
[edit]
Language Label Description Also known as
English
Floyd–Warshall algorithm
algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative

    Statements

    0 references
    0 references
    0 references
    /m/01hj8z
    1 reference