|
gptkbp:instanceOf
|
gptkb:algorithm
gptkb:shortest_path_algorithm
gptkb:graph
|
|
gptkbp:alsoKnownAs
|
gptkb:Roy-Floyd-Warshall_algorithm
|
|
gptkbp:assumesNoNegativeCycles
|
for shortest path correctness
|
|
gptkbp:canBeParallelized
|
true
|
|
gptkbp:category
|
dynamic programming
graph theory
|
|
gptkbp:complexity
|
O(n^3)
|
|
gptkbp:detectsNegativeCycles
|
true
|
|
gptkbp:firstPublished
|
1962
|
|
gptkbp:handlesNegativeWeights
|
true
|
|
gptkbp:improves
|
gptkb:Robert_Floyd
|
|
gptkbp:input
|
weighted directed graph
|
|
gptkbp:namedAfter
|
gptkb:Robert_Floyd
gptkb:Stephen_Warshall
|
|
gptkbp:originallyProposedBy
|
gptkb:Stephen_Warshall
|
|
gptkbp:output
|
shortest distances 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:usedIn
|
computational biology
operations research
network routing
transitive closure
|
|
gptkbp:worksWith
|
adjacency matrix
adjacency list
|
|
gptkbp:bfsParent
|
gptkb:Graph_Algorithms
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Floyd-Warshall Algorithm
|