public void convertToUndirectGraph(UndirectedGraph<Integer, DefaultEdge> undirectGraph, IGraph graph){
		for (int v = 0; v < graph.V(); v++) {
			if(!undirectGraph.containsVertex(v)) undirectGraph.addVertex(v);
			Iterator<Integer> graphIterator = graph.adjIterator(v);
			while (graphIterator.hasNext()) {
				int nextVertex = graphIterator.next();
				if(!undirectGraph.containsVertex(nextVertex)) 	undirectGraph.addVertex(nextVertex);
				if(!undirectGraph.containsEdge(v, nextVertex)) 	undirectGraph.addEdge(v, nextVertex);
			}
		}
	}