Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
graph shortest path algorithm |
| gptkbp:can_be_modified_for |
path reconstruction
transitive closure |
| gptkbp:category |
dynamic programming
|
| gptkbp:complexity |
O(n^3)
|
| gptkbp:detects |
negative cycles (by checking diagonal entries)
|
| gptkbp:does_not_handle |
negative cycles
|
| gptkbp:foundIn |
shortest distances between all pairs of vertices
|
| gptkbp:handles |
negative edge weights
|
| https://www.w3.org/2000/01/rdf-schema#label |
Floyd-Warshall algorithm
|
| gptkbp:input |
adjacency matrix
weighted directed graph |
| gptkbp:namedAfter |
gptkb:Robert_Floyd
gptkb:Stephen_Warshall |
| gptkbp:output |
distance matrix
predecessor matrix |
| gptkbp:publishedIn |
1962
|
| gptkbp:relatedTo |
gptkb:Dijkstra's_algorithm
gptkb:Bellman-Ford_algorithm gptkb:Johnson's_algorithm |
| gptkbp:solvedBy |
all-pairs shortest path problem
|
| gptkbp:spaceComplexity |
O(n^2)
|
| gptkbp:used_in |
network routing
transitive closure computation |
| gptkbp:bfsParent |
gptkb:Dijkstra's_algorithm
gptkb:Graph_theory |
| gptkbp:bfsLayer |
5
|