Floyd–Warshall algorithm

    flowchart
    AA["Associated Authors (0)"]
    C[Floyd–Warshall algorithm]
    BC["Broader Concepts (2)"]
    NC["Narrower Concepts (0)"]
    C== skos:broader ==>BC
    NC== skos:broader ==>C
    AA== dcterms:relation ==>C
    click BC "#broader-concepts"
    click NC "#narrower-concepts"
    click AA "#associated-authors"

    NI["add incoming edge"]
    NO["add outgoing edge"]
    NI-- ? -->C
    C-- ? -->NO
    click NI "#add-incoming-edge"
    click NO "#add-outgoing-edge"
    style NI stroke-width:2px,stroke-dasharray: 5 5
    style NO stroke-width:2px,stroke-dasharray: 5 5

Graph neighborhood for 'Floyd–Warshall algorithm'. Click aggregate nodes to navigate.

Wikidata: https://www.wikidata.org/wiki/Q1047576
OpenAlex ID: https://openalex.org/C186065694 (API record)
OpenAlex Description: algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
OpenAlex Level [?]: 5

Floyd–Warshall algorithm

Broader Concepts

Narrower Concepts

Associated Authors

Add Incoming Edge

Add Outgoing Edge