Next:
Up:
Previous:
Recursive Solution
d
_{ij}
^{(m)}
= weight of path from i to j containing at most m edges
There are at most n-1 edges in the shortest path from i to j assuming no negative weight cycles.
Next:
Up:
Previous: