Wave processing can be used to measure distances and find optimal paths.

The more complicated problem is finding the optimal path.

At the end of the search these references can be used to recover the optimal path.

The optimal path around the track for the lowest lap time.

However, we may decide, after the fact, that the optimal path through the graph is not the answer we want.

There is no longer any guarantee that the optimal path through the graph will not be pruned.

An admissible algorithm can then be used to find the optimal path according to the problem definition.

Again, it must be born in mind that the definition of optimal path depends on the problem.

At the end of each link, a router must choose the optimal path for the data.

One way to find the optimal path is to use a branch and bound technique.