A function that finds the shortest path bounded by two curves

find the shortest Euclidean path that is boundedby the functions low(t) and high(t).the algorithm is based on Dijkstra shortest path search algorithmsyntax:[ty y] = shortest_path_mfile(t,low,high)(See the file shortest_path_example.m - for an...