|
gptkbp:instanceOf
|
gptkb:algorithm
graph
shortest path algorithm
|
|
gptkbp:alsoKnownAs
|
gptkb:Roy–Floyd–Warshall_algorithm
gptkb:Roy–Warshall_algorithm
|
|
gptkbp:can_reconstruct
|
shortest paths (with path matrix)
|
|
gptkbp:category
|
computer science
dynamic programming
|
|
gptkbp:complexity
|
O(n^3)
|
|
gptkbp:detects
|
negative cycles (with modification)
|
|
gptkbp:does_not_handle
|
negative cycles
|
|
gptkbp:firstPublished
|
1962
|
|
gptkbp:handles
|
negative edge weights
|
|
gptkbp:heldBy
|
in-place algorithm (can be implemented in-place)
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Floyd–Warshall algorithm
|
|
gptkbp:input
|
weighted graph
adjacency matrix
|
|
gptkbp:namedAfter
|
gptkb:Robert_Floyd
gptkb:Stephen_Warshall
|
|
gptkbp:output
|
shortest path distances between all pairs of vertices
|
|
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:updated
|
distance matrix
|
|
gptkbp:usedFor
|
finding transitive closure
|
|
gptkbp:uses
|
matrix iteration
|
|
gptkbp:worksWith
|
directed graphs
undirected graphs
|
|
gptkbp:bfsParent
|
gptkb:Robert_W._Floyd
|
|
gptkbp:bfsLayer
|
5
|