- int best = -1;
- int total = 0;
- int i;
-
- for (i = 0; i < population_size; i++)
- {
- if ((best == -1) || (best > population[i].rating))
- best = population[i].rating;
- total += population[i].rating;
- }
-
- printf ("Iterations: %6i; Best: %i; Average: %.2f;\n",
- iterations, best, ((double) total) / ((double) population_size));
-
- return (0);
-} /* int population_print_stats */
-#endif
-
-#if 0
-static int insert_into_population (sn_network_t *n)
-{
- int rating;
- int worst_rating;
- int worst_index;
- int best_rating;
- int nmemb;
- int i;
-
- rating = rate_network (n);
-
- if (population_size < max_population_size)
- {
- population[population_size].network = n;
- population[population_size].rating = rating;
- population_size++;
- return (0);
- }
-
- worst_rating = -1;
- worst_index = -1;
- best_rating = -1;
- for (i = 0; i < olymp_size; i++)