I need to write a program that finds all routes between two points(coordinates) within a graph of NxN size. For example if I have a graph like this:
Code:
(0,0)   (0,1)   (0,2)
(1,0)   (1,1)   (1,2)
(2,0)   (2,1)   (2,2)
where N=3 and the user wants to find the paths between (0,0) and (2,2) the program should display 12 possible routes.Any ideas?