Assertion: floyd warshall algorithm | /r/CapableOf | solve same problem
Facets:
value: in time
type: TEMPORAL
Source sentences:
text: Thus, when the graph is sparse, the total time can be faster than the Floyd–Warshall algorithm, which solves the same problem in time O ( | V | 3 )