Given a directed graph input, G, the code should do the following:
1.  Output all the vertices that have the same in and out degrees
2.  Output the average in-degree and the average out-degree of vertices
3.  Test if G has a cycle
4.  If G has a cycle, then the code should output at least one cycle, 
    else the code should output topological ordering of G
5.  Test if G has at most 3 cycles

See example inputs and outputs in the hw4.pdf file and in the .txt files

You must have a JRE (Java Runtime Environment) installed. You can download it here

1. Download the executable softeng250-hw4.jar file
2. Open up the Command Prompt (Windows) or the Terminal (Mac)
3. Navigate to the directory where this file is located
   • Use cd 'insertfolderpath' without the quotation marks
4. Use java -jar softeng250-hw4.jar to execute the file

1. Download this repository
2. Extract the .zip file into a directory of your choice
3. Open up the Command Prompt (Windows) or the Terminal (Mac)
4. Navigate to the extracted folder softeng250-hw4-master
   • Use cd 'insertfolderpath' without the quotation marks
5. Use javac -cp ./ src/hw4/Main.java
6. Use java src/hw4/Main