int nover = 100 * StreamItOptions.rawRows * StreamItOptions.rawColumns;
int nover = 10 * StreamItOptions.rawRows * StreamItOptions.rawColumns;
    public static void simAnnealAssign(FlatNode node)     {	System.out.println("Simulated Annealing Assignment");	int nsucc, j;	//number of paths tried at a temp	int nover = 100 * StreamItOptions.rawRows * StreamItOptions.rawColumns;	//max number of sucessful path lengths before continuing	int nlimit = 10 * StreamItOptions.rawRows * StreamItOptions.rawColumns;	int cost = 0;	double t = 0.5;		init(node);	random = new Random(17);	//random placement	randomPlacement();		System.out.println("Initial Cost: " + placementCost());	for (j = 0; j < ANNEALITERATIONS; j++) {	    nsucc = 0;	    for (int k = 0; k < nover; k++) {		if (perturbConfiguration(t)) {		    nsucc++;		}		if (nsucc >= nlimit) break;		if (placementCost() == 0)		    break;	    }	    t *= TFACTR;	    if (nsucc == 0) break;	    if (placementCost() == 0)		    break;	}	System.out.println("Final Cost: " + placementCost() + " in  " + j + " iterations.");      	dumpLayout();    }