static void printSolution() {
		System.out.println("Solution is: " + ((best_solution == 0) ? "infeasible" : best_solution));
		int sum_check=0;
		for (int i=0; i < NUM_TASKS; i++) {
			sum_check += graph[assigned_solution[i]][i][0];
			System.out.println("Agent " + assigned_solution[i] + " assigned to task " + i);
			if (verbosity >= 2)
				System.out.println("\t (agent cost = " + graph[assigned_solution[i]][i][0] + ", sum_check = " + sum_check + ")");
		}
		if (verbosity >= 2) {
			System.out.print("sum_check = " + sum_check + ", best_solution = " + best_solution);
			if (sum_check == best_solution) 
				System.out.println("\tverified!");
			else 
				System.out.println("\tvalues don't match!");
		}
	}