Help with Shortest Path Algorithm

   If you have the following predefined given links of a network with 11 nodes 

     link(1,:)=[1 3];
     link(2,:)=[1 2];
     link(3,:)=[1 6];
     link(4,:)=[3 5];
     link(5,:)=[2 7];
     link(6,:)=[2 4];
     link(7,:)=[4 7];
     link(8,:)=[5 8];
     link(9,:)=[6 10];
     link(10,:)=[6 11];
     link(11,:)=[7 11];
     link(12,:)=[10 11];
     link(13,:)=[8 9];
     link(14,:)=[5 6];
     link(15,:)=[8 10];

How would you implement the shortest path algorithm for the above set of links and nodes in matlab ?

[Image Analyst]

Is this a homework assignment? And do you have the Image Processing Toolbox, which can do this?

[Bhavz]

I do have the tool box and no its my own work and earleier i had predefined primary and secondary paths but now i wasnt to compare with shortest path