Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:alsoKnownAs |
gptkb:APSP
|
| gptkbp:application |
social network analysis
map navigation network routing |
| gptkbp:complexity |
O(n^2 log n + nm) for Johnson's algorithm
O(n^3) for Floyd–Warshall |
| gptkbp:doesNotHandleNegativeCycles |
gptkb:Floyd–Warshall_algorithm
gptkb:Johnson's_algorithm |
| gptkbp:field |
computer science
graph theory |
| gptkbp:handlesNegativeWeights |
gptkb:Floyd–Warshall_algorithm
gptkb:Johnson's_algorithm |
| https://www.w3.org/2000/01/rdf-schema#label |
All-Pairs Shortest Path
|
| gptkbp:input |
weighted graph
|
| gptkbp:output |
shortest path distances between all pairs of vertices
|
| gptkbp:solvedBy |
gptkb:shortest_path_problem
|
| gptkbp:supportsAlgorithm |
gptkb:Floyd–Warshall_algorithm
gptkb:Johnson's_algorithm repeated Dijkstra's algorithm |
| gptkbp:bfsParent |
gptkb:Single-Source_Shortest_Path
|
| gptkbp:bfsLayer |
7
|