how to find all possible paths between the two selected nodes.And how to label these nodes from given coordinate points.

The nodes are located at 10 different (x,y)coordinates z =

     8     1
     4     2
     7     3
     1     2
     8     2
     4     3
     7     0
     1     3
     8     4
     4     2

source=(1,2) and target=(8,4)

Answer 1

[Sid Jhaveri]

You might want to refer to the following links:

1) https://www.mathworks.com/matlabcentral/answers/171277-how-can-i-get-all-paths-between-two-nodes

2) http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/

I believe you can also use Yen's K-Shortest Path algorithm. I would recommend searching the MATLAB file exchange for any implementation of this function. I was able to find the following to implementation of this algorithm:

1) https://www.mathworks.com/matlabcentral/fileexchange/32513-k-shortest-path-yen-s-algorithm

2) https://www.mathworks.com/matlabcentral/fileexchange/35397-k-shortest-paths-in-a-graph-represented-by-a-sparse-matrix--yen-s-algorithm-

Please note that you would have to store the information regarding the edges of the given graph somewhere (For example a matrix). Without the information about edges, it might not be possible to achieve this. Thus, I would recommend creating and storing information regarding the edges of this graph in a matrix before trying the above given solutions/ideas.