Graph.pde

class Graph{
  ArrayList<Vertex> V=new ArrayList();
  ArrayList<Edge> E=new ArrayList();
  boolean ValidNewEdge(Vertex v1,Vertex v2){
    if(v1==v2)return false;
    for(Edge i:v1.E){
      if((i.v1==v1)&&(i.v2==v2))return false;
      if((i.v2==v1)&&(i.v1==v2))return false;
    }
    return true;
  }
  
  boolean ValidGraph(){
    int min=Integer.MAX_VALUE;
    for(Vertex i:V){
      if(i.E.size()<=min)min=i.E.size();
    }
    boolean x= (min==3);
    boolean y= E.size() <= (3*V.size() -6);
    return x&&y;
  }
  boolean check3edges_per_vertex(Vertex v){ 
      if(v.E.size()<3) return true;
      if(v.E.size()>=3) return false; 
    return true;
  }
}