You are asked to write a java program that can read in a text file that contains multiple directed
graphs and find a topological order for each graph, if such order exists.
Compile : javac topSort.java
RUN : java topSort graphs.txt
where graphs.txt is the input file that contains multiple graphs. graphs.txt is given which contains 50 graphs for testing acyclic.
