Using Java, a program that will compute all prime paths in a graph

I am looking for a Java programmer who knows software testing to design and implement a program that will compute all prime paths in a graph, then derive test paths to tour the prime paths. The program will accept a graph as input by reading a list of nodes, initial nodes, final nodes, and edges.
Give the test criteria you use to test your program. Give the test cases you used to test the program with the rationale behind each test case.