Am 21. April 2017 06:45:09 MESZ schrieb Avinoam <

[hidden email]>:

Hi Avinoam,

in Octave you'd solve it like in any other programming language. First, you need an algorithm. I guess you can use something similar to the Dijkstra algorithm, since you are looking for an optimal path through the entries of the matrix. That is, you iterate k=1...N and compute for all entries A(:, k) and A(k, :) what their optimal sum of weight and path is. Finally the optimal path can be found for entry A(N, N). I don't want to spoil the complete lesson, so you may find out the details yourself ;-)

Oliver

_______________________________________________

Help-octave mailing list

[hidden email]
https://lists.gnu.org/mailman/listinfo/help-octave