IMPLEMENTED IN JAVA

Abstract In this assignment, you will determine whether an arbitrary directed graph contains a topph - an ordering of its vertices that simultaneously corresponds to a valid path in the graph and a valid topological sort.1 More than anything, this program should serve as a relatively short critical thinking exercise You will gain experience reading graphs from an input file, representing them computationally, and writing graph theory algorithms. You will also solidify your understanding of topological sorts, sharpen your problem solving skills, and get some practice at being clever, because your solution to this problem must be 0(n) In coming up with a solution, I recommend focusing first on developing a working algorithm, and then analyzing its runtime. (Focusing too much on the runtime restriction might cloud your thinking as you cook up a solution to this problem.) If you use any code that I have given you so far in class, you should probably include a comment to give me credit. The intellectually curious student will, of course, try to write the whole program from scratch. Deliverables TopoPath.java