Roy–Floyd–Warshall algorithm
GPTKB entity
Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
graph shortest path algorithm |
| gptkbp:alsoKnownAs |
gptkb:Floyd–Warshall_algorithm
|
| gptkbp:category |
dynamic programming
|
| gptkbp:complexity |
O(n^3)
|
| gptkbp:doesNotHandle |
negative cycles
|
| gptkbp:firstPublished |
1962
|
| gptkbp:handles |
negative edge weights
|
| https://www.w3.org/2000/01/rdf-schema#label |
Roy–Floyd–Warshall algorithm
|
| gptkbp:input |
adjacency matrix
|
| gptkbp:namedAfter |
gptkb:Robert_Floyd
gptkb:Stephen_Warshall Bernard Roy |
| gptkbp:output |
matrix of shortest path distances
|
| gptkbp:relatedTo |
gptkb:Dijkstra's_algorithm
gptkb:Bellman–Ford_algorithm |
| gptkbp:solvedBy |
all-pairs shortest path problem
|
| gptkbp:spaceComplexity |
O(n^2)
|
| gptkbp:worksWith |
weighted directed graphs
|
| gptkbp:bfsParent |
gptkb:Floyd–Warshall_algorithm
|
| gptkbp:bfsLayer |
6
|