How can I find all the minimal paths in a network?

Hi everyone,

At first, I should say a minimal path is a path with no cycle.

For example, in a network with adjacent matrix M=[0 3 1 0; 3 0 1 2; 1 1 0 2; 0 2 2 0], the set of all minimal paths are MP={ {(1,2), (2,4)}, {(1,3), (3,4)}, {(1,2), (2,3), (3,4)}, {(1,3), (3,2), (2,4)} }.

I need a matlab program for finding all the minimal paths of a given network.

I highly appreciate your help in advance.

Majid

Answer 1

[Image Analyst]

You might try this, if you have the Image Processing Toolbox: http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/