public int searchEdgesToSetNull(Edge[] list, Vertex in, Vertex out, int index){
		  int edgePos = -1;
			for(int i = 0;i < numEdges; i++){
				if(list[i]!=null && list[i].inVertex != null && list[i].outVertex != null){
					//checking for exact match with an edge
					//System.out.println("***** List[i]:: "+list[i].inVertex.name +" - "+list[i].outVertex.name);
					if(((list[i].inVertex.name.equalsIgnoreCase(in.name))//|| list[i].inVertex.name.contains(in.name) 
							&& (list[i].outVertex.name.equalsIgnoreCase(out.name))) || //|| list[i].outVertex.name.contains(out.name)
							((list[i].inVertex.name.equalsIgnoreCase(out.name))//|| list[i].inVertex.name.contains(out.name) 
							&& (list[i].outVertex.name.equalsIgnoreCase(in.name)))){//|| list[i].outVertex.name.contains(in.name)
						//System.out.println("***** Found edge! : index::"+index+"list[i].index::"+list[i].index);
						//if an edge was found
						edgePos = i;//returning its position in the array
						//INCREMENT FREQUENCY IF THE EDGE WAS FOUND IN A DIFFERENT SENT. (CHECK BY MAINTAINING A TEXT NUMBER AND CHECKING IF THE NEW # IS DIFF FROM PREV #)
						if(index != list[i].index){
							list[i].frequency++;
						}
						//System.out.println(list[i].inVertex.name+" - "+list[i].outVertex.name+" freq:: "+list[i].frequency);
						//System.out.println(in.name+" - "+out.name+" freq:: "+list[i].frequency);
					}
				}
			}
//		System.out.println("***** searchEdgesToSetNull:: "+in.name +" - "+out.name+" returning:: "+edgePos);
		return edgePos;
	}