/*//////////////////////////////////////////////////////////
	15-111 Sections G and H
	Lab 5 Template
	Name:
	Section:
	Andrew Id:
	Last Updated:
	Comments to the grader:
	
	class Driver
///////////////////////////////////////////////////////////*/



public class Driver 
{ 
  
	public static void main(String args[]) 
	{   
	    Graph G= new Graph();
	    G.initialize("graph.txt");
	    G.print();
	    // find max in degree 
	    int maximum=0;
	    for (int i=0; i<G.getVertices();i++)
	       if (G.inDegree(i) > maximum)
	          maximum = G.inDegree(i);
	    System.out.println("The maximum in degree is " + maximum);
	     // find max out degree 
	    maximum=0;
	    for (int i=0; i<G.getVertices();i++)
	       if (G.outDegree(i) > maximum)
	          maximum = G.outDegree(i);
	    System.out.println("The maximum out degree is " + maximum);
	     // find max degree 
	    maximum=0;
	    for (int i=0; i<G.getVertices();i++)
	       if (G.degree(i) > maximum)
	          maximum = G.degree(i);
	    System.out.println("The maximum degree is " + maximum);
	    // find min in degree 
	    int minimum=0;
	    for (int i=0; i<G.getVertices();i++)
	       if (G.inDegree(i) < minimum)
	          minimum = G.inDegree(i);
	    System.out.println("The minimum in degree is " + minimum);
	     // find max out degree 
	    minimum=0;
	    for (int i=0; i<G.getVertices();i++)
	       if (G.outDegree(i) < minimum)
	          minimum = G.outDegree(i);
	    System.out.println("The minimum out degree is " + minimum);
	     // find max degree 
	    minimum=0;
	    for (int i=0; i<G.getVertices();i++)
	       if (G.degree(i) < minimum)
	          minimum = G.degree(i);
	    System.out.println("The minimum degree is " + minimum);
	          
        System.out.println("That's all folks"); 

	}
}