Assertion: algorithm | /r/CapableOf | calculate shortest paths
Facets:
value: with at-most 2 edges
type: OTHER
value: like other dynamic programming problems
type: OTHER
value: in a bottom-up manner
type: MANNER
Source sentences:
text: Like other Dynamic Programming Problems, the algorithm calculates shortest paths in a bottom-up manner.
text: Then, it calculates the shortest paths with at-most 2 edges, and so on.
text: It first calculates the shortest distances which have at-most one edge in the path.