Prime path
Budget: $10 – $30 USD
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.
Use Java. Along with the Java Program, submit the UML Activity Diagram. If the whole logic is in one method, submit the standard Activity Diagram. If the logic expands across more than one method, submit Swimlane Activity Diagram instead.
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.
Use Java. Along with the Java Program, submit the UML Activity Diagram. If the whole logic is in one method, submit the standard Activity Diagram. If the logic expands across more than one method, submit Swimlane Activity Diagram instead.
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.