给我模拟退火算法的C语言代码，要求表明邻接矩阵

以下是一个基于邻接矩阵的模拟退火算法的C语言代码：

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>

#define MAX_CITY 100
#define MAX_TEMP 100.0
#define MIN_TEMP 1.0
#define ALPHA 0.9
#define ITERATION 10000

int n;
int city[MAX_CITY][2];
int dist[MAX_CITY][MAX_CITY];

int calc_distance(int i, int j) {
    int dx = city[i][0] - city[j][0];
    int dy = city[i][1] - city[j][1];
    return (int)round(sqrt(dx*dx + dy*dy));
}

int calc_total_distance(int *route) {
    int total_dist = 0;
    for (int i = 0; i < n-1; i++) {
        total_dist += dist[route[i]][route[i+1]];
    }
    total_dist += dist[route[n-1]][route[0]];
    return total_dist;
}

void generate_initial_solution(int *route) {
    for (int i = 0; i < n; i++) {
        route[i] = i;
    }
    for (int i = 0; i < n; i++) {
        int j = rand() % n;
        int tmp = route[i];
        route[i] = route[j];
        route[j] = tmp;
    }
}

void copy_solution(int *src, int *dst) {
    for (int i = 0; i < n; i++) {
        dst[i] = src[i];
    }
}

void simulated_annealing(int *route) {
    srand((unsigned int)time(NULL));
    generate_initial_solution(route);
    int curr_dist = calc_total_distance(route);
    int *tmp_route = (int *)malloc(sizeof(int)*n);
    double temperature = MAX_TEMP;
    while (temperature > MIN_TEMP) {
        for (int i = 0; i < ITERATION; i++) {
            copy_solution(route, tmp_route);
            int j = rand() % n;
            int k = rand() % n;
            int tmp = tmp_route[j];
            tmp_route[j] = tmp_route[k];
            tmp_route[k] = tmp;
            int new_dist = calc_total_distance(tmp_route);
            int delta = new_dist - curr_dist;
            if (delta < 0 || exp(-delta/temperature) > ((double)rand()/RAND_MAX)) {
                curr_dist = new_dist;
                copy_solution(tmp_route, route);
            }
        }
        temperature *= ALPHA;
    }
    free(tmp_route);
}

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &city[i][0], &city[i][1]);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            dist[i][j] = calc_distance(i, j);
        }
    }
    int *route = (int *)malloc(sizeof(int)*n);
    simulated_annealing(route);
    printf("Optimal route: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", route[i]);
    }
    printf("\nOptimal distance: %d\n", calc_total_distance(route));
    free(route);
    return 0;
}

其中，`n`为城市数，`city`是一个二维数组，存储每个城市的坐标，`dist`是一个二维数组，存储城市之间的距离。`calc_distance`函数计算两个城市之间的距离，`calc_total_distance`函数计算一条路径的总距离，`generate_initial_solution`函数生成初始解，`copy_solution`函数复制解，`simulated_annealing`函数实现模拟退火算法。在`main`函数中读入城市坐标、计算距离、调用`simulated_annealing`函数求解最优路径和距离。