A function that finds the shortest path bounded by two curves

finds the shortest path bounded between low(t) and high(t).

find the shortest Euclidean path that is bounded
by the functions low(t) and high(t).

the algorithm is based on Dijkstra shortest path search algorithm

syntax:
[ty y] = shortest_path_mfile(t,low,high)
(See the file shortest_path_example.m - for an example)

input:
t - input time values. row vector.
low(t) - is the lower bound. raw vector.
high(t) - is the upper bound. raw vector.

output:
ty - is a vector of time samples
y(ty) - is the shortest path