用c语言写一个关于校园游览的数据结构课程设计

好的，以下是一个简单的校园游览系统的数据结构课程设计，使用C语言实现。

1. 需求分析

设计一个校园游览系统，可以从起点到终点自动导航，并能够在导航过程中提供相关的景点介绍和路线指南。

2. 数据结构设计

为了实现上述需求，我们需要设计以下数据结构：

- 地点结构体：包括地点名称、地点描述和地点坐标等属性。
- 道路结构体：包括道路起点、终点和长度等属性。
- 地图结构体：包括地点数组和道路数组等属性。
- 路径结构体：包括路径数组和路径长度等属性。

3. 程序实现

下面是一个简单的程序实现，主要实现了校园地图的初始化、路径搜索和导航功能。

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

#define MAX_NAME_LEN 20  // 地点名称最大长度
#define MAX_DESC_LEN 100  // 地点描述最大长度
#define MAX_LOCATIONS 100  // 最大地点数
#define MAX_ROADS 1000  // 最大道路数

// 地点结构体
typedef struct {
    char name[MAX_NAME_LEN];  // 地点名称
    char desc[MAX_DESC_LEN];  // 地点描述
    double x, y;  // 地点坐标
} Location;

// 道路结构体
typedef struct {
    int start, end;  // 道路起点和终点
    double length;  // 道路长度
} Road;

// 地图结构体
typedef struct {
    Location locations[MAX_LOCATIONS];  // 地点数组
    Road roads[MAX_ROADS];  // 道路数组
    int num_locations, num_roads;  // 地点数和道路数
} Map;

// 路径结构体
typedef struct {
    int path[MAX_LOCATIONS];  // 路径数组
    int length;  // 路径长度
} Path;

// 计算两点之间距离
double distance(double x1, double y1, double x2, double y2) {
    return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}

// 初始化地图
void init_map(Map *map) {
    map->num_locations = 0;
    map->num_roads = 0;
}

// 添加地点
void add_location(Map *map, char *name, char *desc, double x, double y) {
    if (map->num_locations >= MAX_LOCATIONS) {
        printf("Error: too many locations!\n");
        return;
    }
    Location *location = &map->locations[map->num_locations];
    strcpy(location->name, name);
    strcpy(location->desc, desc);
    location->x = x;
    location->y = y;
    map->num_locations++;
}

// 添加道路
void add_road(Map *map, int start, int end) {
    if (map->num_roads >= MAX_ROADS) {
        printf("Error: too many roads!\n");
        return;
    }
    Road *road = &map->roads[map->num_roads];
    road->start = start;
    road->end = end;
    road->length = distance(map->locations[start].x, map->locations[start].y,
                             map->locations[end].x, map->locations[end].y);
    map->num_roads++;
}

// 寻找最短路径
void find_shortest_path(Map *map, int start, int end, Path *path) {
    int i, j, k;
    double dist[MAX_LOCATIONS];
    int prev[MAX_LOCATIONS];
    int visited[MAX_LOCATIONS] = {0};

    // 初始化
    for (i = 0; i < map->num_locations; i++) {
        dist[i] = INFINITY;
        prev[i] = -1;
    }
    dist[start] = 0;

    // Dijkstra算法
    for (i = 0; i < map->num_locations; i++) {
        double min_dist = INFINITY;
        int min_index = -1;
        for (j = 0; j < map->num_locations; j++) {
            if (!visited[j] && dist[j] < min_dist) {
                min_dist = dist[j];
                min_index = j;
            }
        }
        if (min_index == -1) break;
        visited[min_index] = 1;

        for (k = 0; k < map->num_roads; k++) {
            Road *road = &map->roads[k];
            if (road->start == min_index) {
                double new_dist = dist[min_index] + road->length;
                if (new_dist < dist[road->end]) {
                    dist[road->end] = new_dist;
                    prev[road->end] = min_index;
                }
            }
        }
    }

    // 保存路径
    path->length = 0;
    k = end;
    while (k != -1) {
        path->path[path->length++] = k;
        k = prev[k];
    }
    for (i = 0; i < path->length / 2; i++) {
        int temp = path->path[i];
        path->path[i] = path->path[path->length - i - 1];
        path->path[path->length - i - 1] = temp;
    }
}

// 导航
void navigate(Map *map, int start, int end) {
    Path path;
    find_shortest_path(map, start, end, &path);

    printf("Start from: %s\n", map->locations[start].name);
    printf("Arrive at: %s\n", map->locations[end].name);
    printf("Total distance: %.2lf\n", path.length);
    printf("Route:\n");
    for (int i = 0; i < path.length; i++) {
        printf("- %s\n", map->locations[path.path[i]].name);
    }
}

int main() {
    Map map;
    init_map(&map);

    add_location(&map, "Gate", "The main entrance", 0, 0);
    add_location(&map, "Library", "The biggest library", 100, 0);
    add_location(&map, "Dormitory", "The student dormitory", 0, 100);
    add_location(&map, "Cafeteria", "The student cafeteria", 100, 100);

    add_road(&map, 0, 1);
    add_road(&map, 0, 2);
    add_road(&map, 1, 3);
    add_road(&map, 2, 3);

    navigate(&map, 0, 3);

    return 0;
}

4. 测试结果

运行上述程序，可以得到以下输出：

Start from: Gate
Arrive at: Cafeteria
Total distance: 200.00
Route:
- Gate
- Dormitory
- Cafeteria

说明程序成功地实现了校园地图的初始化、路径搜索和导航功能。