text: can anyone help me with a java program? i am suppose to write a java program that uses recursive functinon to count the number of northeast paths from one point to another (user could input the values) in a rectangular grid, and prints out all the paths like: there are 4 paths from (0,1) to (3,2) (0,1) (0,2) (2,1) (2,2) (3,2) (0,1) (1,1) (1,2) (2,2) (3,2) (0,1) (1,1) (2,1) (2,2) (3,2) (0,1) (1,1) (2,1) (3,1) (3,2) i recently wrote an application somewhat similar to this... but i can't find the code right now.. so for now i'll just pass on a link to dijkstra's shortest path algorithm... it's not the exact answer to your question but it'll give you some ideas and some sample code.