public class HopfieldNetwork0{ private final int D = 5; //dimension private final int patterns[][] = {{1,1,1,1,-1},{-1,-1,-1,1,1}}; private int matrix[][]; private int input[]; private int output[]; private int X1[] = {1,1,1,1,1}; private int X2[] = {-1,-1,-1,-1,-1}; public HopfieldNetwork0(){ matrix = new int[D][D]; input = new int[D]; output = new int[D]; for(int j=0; j0) output[m]=1; else if(output[m]==0) output[m]=input[m]; else output[m]=-1; } iteration++; if(iteration>999) break; for(int i=0; i