用C语言写代码解决春游问题

以下是一个简单的用C语言解决春游问题的示例代码：

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

#define MAX_VERTICES 1000
#define MAX_EDGES 10000

typedef struct {
    int from, to;
    double cost;
} Edge;

typedef struct {
    int parent;
} DisjointSet;

int cmp(const void *a, const void *b) {
    Edge *a1 = (Edge *)a;
    Edge *b1 = (Edge *)b;
    if (a1->cost < b1->cost) {
        return -1;
    } else if (a1->cost > b1->cost) {
        return 1;
    } else {
        return 0;
    }
}

int find(DisjointSet *sets, int i) {
    if (sets[i].parent != i) {
        sets[i].parent = find(sets, sets[i].parent);
    }
    return sets[i].parent;
}

void union_set(DisjointSet *sets, int x, int y) {
    int root1 = find(sets, x);
    int root2 = find(sets, y);
    sets[root1].parent = root2;
}

void kruskal(Edge *edges, int n, int m) {
    int i, j, k;
    DisjointSet sets[MAX_VERTICES];
    double cost = 0;
    for (i = 0; i < n; i++) {
        sets[i].parent = i;
    }
    qsort(edges, m, sizeof(Edge), cmp);
    for (i = 0; i < m; i++) {
        int from = edges[i].from;
        int to = edges[i].to;
        double cost = edges[i].cost;
        if (find(sets, from) != find(sets, to)) {
            cost += edges[i].cost;
            union_set(sets, from, to);
            printf("(%d,%d) %lf\n", from, to, cost);
        }
    }
    printf("Total cost: %lf\n", cost);
}

int main() {
    int n, m, i, j, k;
    Edge edges[MAX_EDGES];
    printf("Enter the number of vertices and edges: ");
    scanf("%d %d", &n, &m);
    printf("Enter the edges and their costs:\n");
    for (i = 0; i < m; i++) {
        scanf("%d %d %lf", &edges[i].from, &edges[i].to, &edges[i].cost);
    }
    kruskal(edges, n, m);
    return 0;
}

该示例代码使用了Kruskal算法来求解春游问题，其思路是将旅游景点看作节点，旅游路线看作边，通过求解最小生成树来得到最优的旅游路线方案。在代码中，我们首先输入景点的数量和路线的数量，然后输入路线的起点、终点和花费。最后使用Kruskal算法求解最小生成树并输出结果。需要注意的是，该示例代码只是一个简单的示例，实际的春游问题可能会更加复杂，需要根据具体情况进行调整和修改。