Six cities in matlab with Dijkstra's Algorithm

Hi, I have a problem finding the correct way to do this. The question is: In matlab must solve the problem of finding the minimum path between six cities. It should be used for this Dkjistra algorithm. The distance between the cities must be stored in a 6x6 matrix. When there is no road between the cities, the corresponding value should be taken as an integer like (100000000000).

Any help plis?

Answer 1

[Cedric]

Just use the FEX submission by Joseph Kirk that I used in this answer: http://www.mathworks.com/matlabcentral/answers/82034-how-do-i-detect-volume-collisions.

Build the C matrix based on connections between cities and distances, and A e.g. the way I build it in the aforementioned solution, and you're almost done.