static void makeGraphRandom() throws Exception {
		NUM_AGENTS = 12;
		NUM_TASKS = 16;
		graph = new double[NUM_AGENTS][NUM_TASKS][3]; // use innermost array as holding <cost, capacity, pheromone>
		for (int i = 0; i < NUM_AGENTS; i++) { // go through agents
			for (int j = 0; j < NUM_TASKS; j++) { // go through tasks 
				for (int k = 0; k < 3; k++) { // begin assigning <cost, capacity, pheromone>
					switch (k) {
					case 0: // cost if agent does this task
						graph[i][j][k] = generator.nextInt(10)+1; // [1,10)
						if (verbosity >= 2)
							System.out.println("cost = " + graph[i][j][k] + " (agent " + i + ", at task " + j + ")"); 
						break;
					case 1: // capacity lost if agent does this task
						graph[i][j][k] = generator.nextInt(4)+1; // [1,4)
						if (verbosity >= 2) 
							System.out.println("capacity = " + graph[i][j][k] + "  (agent " + i + ", task " + j + ")");
						break;
					case 2: // pheromone
						graph[i][j][k] = 0;
						break;
					default: // error
						throw new Exception("Attempted to access element " + k + " in innermost array!");
					}		
				}
			}	
		}
	}