94 int num_gene,
Edge *edge_table)
102 for (
i = 1;
i <= num_gene;
i++)
112 for (index1 = 0; index1 < num_gene; index1++)
119 index2 = (index1 + 1) % num_gene;
126 edge_total +=
gimme_edge(root, tour1[index1], tour1[index2], edge_table);
127 gimme_edge(root, tour1[index2], tour1[index1], edge_table);
129 edge_total +=
gimme_edge(root, tour2[index1], tour2[index2], edge_table);
130 gimme_edge(root, tour2[index2], tour2[index1], edge_table);
134 return ((
float) (edge_total * 2) / (
float) num_gene);
156 int city1 = (int) gene1;
157 int city2 = (int) gene2;
163 for (
i = 0;
i < edges;
i++)
165 if ((
Gene) abs(edge_table[city1].edge_list[
i]) == city2)
176 edge_table[city1].
edge_list[edges] = city2;
197 int edge_failures = 0;
202 for (
i = 1;
i < num_gene;
i++)
209 remove_gene(root, new_gene[
i - 1], edge_table[(
int) new_gene[
i - 1]], edge_table);
213 if (edge_table[new_gene[
i - 1]].unused_edges > 0)
214 new_gene[
i] =
gimme_gene(root, edge_table[(
int) new_gene[
i - 1]], edge_table);
220 new_gene[
i] =
edge_failure(root, new_gene,
i - 1, edge_table, num_gene);
224 edge_table[(int) new_gene[
i - 1]].unused_edges = -1;
227 return edge_failures;
253 genes_remaining = edge_table[possess_edge].
unused_edges;
256 for (
j = 0;
j < genes_remaining;
j++)
259 if ((
Gene) abs(edge_table[possess_edge].edge_list[
j]) == gene)
265 edge_table[possess_edge].
edge_list[genes_remaining - 1];
285 int minimum_count = -1;
310 return (
Gene) abs(
friend);
329 if (edge_table[(
int)
friend].unused_edges < minimum_edges)
331 minimum_edges = edge_table[(int)
friend].unused_edges;
334 else if (minimum_count == -1)
336 else if (edge_table[(
int)
friend].unused_edges == minimum_edges)
342 rand_decision =
geqo_randint(root, minimum_count - 1, 0);
354 if (minimum_count == rand_decision)
360 elog(
ERROR,
"neither shared nor minimum number nor random edge found");
374 int remaining_edges = 0;
384 for (
i = 1;
i <= num_gene;
i++)
386 if ((edge_table[
i].unused_edges != -1) && (
i != (
int) fail_gene))
390 if (edge_table[
i].total_edges == 4)
405 for (
i = 1;
i <= num_gene;
i++)
408 if ((
Gene)
i != fail_gene &&
409 edge_table[
i].unused_edges != -1 &&
410 edge_table[
i].total_edges == 4)
415 if (rand_decision == four_count)
420 elog(
LOG,
"no edge found via random decision and total_edges == 4");
422 else if (remaining_edges != 0)
425 rand_decision =
geqo_randint(root, remaining_edges - 1, 0);
427 for (
i = 1;
i <= num_gene;
i++)
430 if ((
Gene)
i != fail_gene &&
431 edge_table[
i].unused_edges != -1)
436 if (rand_decision == remaining_edges)
441 elog(
LOG,
"no edge found via random decision with remaining edges");
455 for (
i = 1;
i <= num_gene;
i++)
456 if (edge_table[
i].unused_edges >= 0)
459 elog(
LOG,
"no edge found via looking for the last unused point");
elog(ERROR, "%s: %s", p2, msg)
static int gimme_edge(PlannerInfo *root, Gene gene1, Gene gene2, Edge *edge_table)
float gimme_edge_table(PlannerInfo *root, Gene *tour1, Gene *tour2, int num_gene, Edge *edge_table)
void free_edge_table(PlannerInfo *root, Edge *edge_table)
static Gene gimme_gene(PlannerInfo *root, Edge edge, Edge *edge_table)
int gimme_tour(PlannerInfo *root, Edge *edge_table, Gene *new_gene, int num_gene)
static Gene edge_failure(PlannerInfo *root, Gene *gene, int index, Edge *edge_table, int num_gene)
static void remove_gene(PlannerInfo *root, Gene gene, Edge edge, Edge *edge_table)
Edge * alloc_edge_table(PlannerInfo *root, int num_gene)
int geqo_randint(PlannerInfo *root, int upper, int lower)
if(TABLE==NULL||TABLE_index==NULL)
void pfree(void *pointer)