- int rate;
- int i;
-
- rate = SN_NETWORK_STAGE_NUM (n) * SN_NETWORK_INPUT_NUM (n);
- for (i = 0; i < SN_NETWORK_STAGE_NUM (n); i++)
- {
- sn_stage_t *s = SN_NETWORK_STAGE_GET (n, i);
- rate += SN_STAGE_COMP_NUM (s);
- }
-
- return (rate);
-} /* int rate_network */
-#endif
-
-#if 0
-static int population_print_stats (int iterations)
-{
- 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)