What should be algorithm to find all the disjoint paths between any number of pairs of cells given in matrix?
We will say two paths will not intersect if there there is no cell common between any two paths.
My approach is : I will pick first cell pair and create a path between them. Now it will work as obstacle for path between other cell pairs. But problem is how to first pick which cell pair? Because it will create problem in finding path between some cell pair in future.