public static boolean BFS( ){
		boolean bicoloreable = true;
		Queue<Integer> cola = new LinkedList<Integer>();
		cola.add(0);
		color[0] = 1;
		while (!cola.isEmpty()) {
			
			int a = cola.poll();
			for (int i = 0; i < mAdy.length; i++) {
				if(color[i]==-1 && mAdy[a][i]){
					cola.add(i);
					if(color[a]==1)
						color[i]=2;
					else
						color[i]=1;
				}else if( color[i] == color[a] && mAdy[a][i]){
					bicoloreable = false;
					break;
				}
			}
		}
		return bicoloreable;
	}