Roy-Floyd-Warshall algorithm
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
graph shortest path algorithm |
| gptkbp:alsoKnownAs |
gptkb:Floyd-Warshall_algorithm
|
| gptkbp:canBe |
negative edge weights
|
| gptkbp:cannotHandle |
negative cycles
|
| gptkbp:category |
dynamic programming
|
| gptkbp:complexity |
O(n^3)
|
| gptkbp:firstPublished |
1962
|
| https://www.w3.org/2000/01/rdf-schema#label |
Roy-Floyd-Warshall algorithm
|
| gptkbp:input |
weighted directed graph
|
| gptkbp:namedAfter |
gptkb:Robert_Floyd
gptkb:Stephen_Warshall Bernard Roy |
| gptkbp:output |
shortest paths between all pairs of vertices
|
| gptkbp:relatedTo |
gptkb:Dijkstra's_algorithm
gptkb:Bellman-Ford_algorithm |
| gptkbp:solvedBy |
all-pairs shortest path problem
|
| gptkbp:spaceComplexity |
O(n^2)
|
| gptkbp:usedFor |
transitive closure
finding reachability in graphs |
| gptkbp:bfsParent |
gptkb:Floyd-Warshall_Algorithm
|
| gptkbp:bfsLayer |
7
|