Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:graph |
| gptkbp:category |
all-pairs reachability
|
| gptkbp:complexity |
O(n^3)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:input |
gptkb:graph
|
| gptkbp:introducedIn |
1962
|
| gptkbp:namedAfter |
gptkb:Stephen_Warshall
Bernard Roy |
| gptkbp:output |
transitive closure of a graph
|
| gptkbp:relatedTo |
gptkb:Floyd–Warshall_algorithm
|
| gptkbp:solvedBy |
transitive closure problem
|
| gptkbp:uses |
adjacency matrix
|
| gptkbp:bfsParent |
gptkb:Floyd–Warshall_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Roy–Warshall algorithm
|