First_Project/utils.c at main · nermine11/First_Project · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include <stdio.h>
#include <stdlib.h>
#include "utils.h"

void debug_print_path(Path* path, const char* message) {
    int i;
    if (!path || !message) {
        return;
    }
    fprintf(stderr, "%s: ", message);
    for (i = 0; i < path->path_length; i++) {
        fprintf(stderr, "%d", path->path[i]);
        if (i < path->path_length - 1) {
            fprintf(stderr, " → ");
        }
    }
    fprintf(stderr, "\n");
}

void print_individual(Individual* individual) {
    int d, j;
    Path path;

    if(!individual) {
        fprintf(stderr, "Individual is NULL\n");
        return;
    }

    printf("Individual metrics:\n");
    printf("Total time: %.2f\n", individual->total_time);
    printf("Total distance: %.2f\n", individual->total_distance);
    printf("Number of deliverers: %d\n", individual->nb_deliverers);

    for (d = 0; d < individual->nb_deliverers; d++) {
        printf("Deliverer %d: ", d + 1);
        path = individual->deliverers_paths[d];

        if(!path.path) {
            fprintf(stderr, "Path is NULL\n");
            continue;
        }

        for (j = 0; j < path.path_length; j++) {
            printf("%d", path.path[j]);
            if (j < path.path_length - 1) {
                printf(" → ");
            }
        }
        printf("  time: %.1f distance: %.1f length: %d\n", path.total_time, path.total_distance, path.path_length);
    }
}

void print_parents(Parents* parents) {
    int i, j;
    Path path;
    if (!parents || !parents->parent1 || !parents->parent2) {
        fprintf(stderr, "Invalid parent(s)\n");
        return;
    }

    printf("Parent 1:\n");
    for (i = 0; i < parents->parent1->nb_deliverers; i++) {
        printf("  Deliverer %d: ", i + 1);
        path = parents->parent1->deliverers_paths[i];
        for (j = 0; j < path.path_length; j++) {
            printf("%d", path.path[j]);
            if (j < path.path_length - 1) {
                printf(" → ");
            }
        }
        printf("\n");
    }

    printf("\nParent 2:\n");
    for (i = 0; i < parents->parent2->nb_deliverers; i++) {
        printf("  Deliverer %d: ", i + 1);
        path = parents->parent2->deliverers_paths[i];
        for (j = 0; j < path.path_length; j++) {
            printf("%d", path.path[j]);
            if (j < path.path_length - 1) {
                printf(" → ");
            }
        }
        printf("\n");
    }

    printf("\n");
}

void print_path(Path* path){
    int i;
    printf("Total_time: %f Total_distance: %f | ", path->total_time, path->total_distance);
    for(i = 0; i < path->path_length - 1; i++){
        printf("%d", path->path[i]);
        if (i < path->path_length - 1) {
            printf(" → ");
        }
    }
    printf("0\n");
}

void print_population(Population* population) {
    int i, d, j;
    Path path;
    Individual* individual;
    for (i = 0; i < POPULATION_SIZE; i++) {
        if (!population->population[i]) {  /* Check before use */
            printf("individual %d: NULL\n\n", i + 1);
            continue;
        }
        individual = population->population[i];
        printf("individual %d -> %f\n\n", i + 1, individual->fitness);
        for (d = 0; d < individual->nb_deliverers; d++) {
            printf("deliverer %d: ", d + 1);
            path = individual->deliverers_paths[d];
            for (j = 0; j < path.path_length; j++) {
                printf("%d", path.path[j]);
                if (j < path.path_length - 1) {
                    printf(" → ");
                }
            }
            printf(" total_time: %f\n", path.total_time);
        }
        printf("\n");
    }
}