|
2 | edited body | ||
|
In this generality, the shortest path is not necessarily well defined, i.e., it can happen that the minimum is not attained, approximations to the minimizer being paths going further and further away to infinity. Hence, no algorithm is guaranteed to terminate cotrectly correctly in finite time. |
||||
|
|
1 |
|
||
|
In this generality, the shortest path is not necessarily well defined, i.e., it can happen that the minimum is not attained, approximations to the minimizer being paths going further and further away to infinity. Hence, no algorithm is guaranteed to terminate cotrectly in finite time. |
||||
