1）地图实现功能：设计校园平面图，展示校园中所有地点。2）地点查询功能：为来访客人提供图中任意景点相关信息的查询。3）导航功能：为来访客人提供途中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。3）导航功能：为来访客人提供途中任意两个景点的所有路线查询，即查询任意两个景点之间的所有路径。4）导航功能（多点导航）：实现多个景点之间的访问路线查询，即查询路过多个景点的一条最短的简单路径。C语言代码

以下是一个基于C语言的简单校园导航系统代码示例，包括地图数据结构和导航算法实现。该代码示例使用邻接矩阵存储地图信息，使用Dijkstra算法实现最短路径查询。

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

#define MAX_VERTICES 100
#define INF 1000000

typedef struct {
    int weight;
    char* name;
} Vertex;

typedef struct {
    int n;
    Vertex vertices[MAX_VERTICES];
    int edges[MAX_VERTICES][MAX_VERTICES];
} Graph;

int get_vertex_index(Graph* g, char* name) {
    int i;
    for (i = 0; i < g->n; i++) {
        if (strcmp(g->vertices[i].name, name) == 0) {
            return i;
        }
    }
    return -1;
}

void add_vertex(Graph* g, char* name) {
    int index = g->n;
    g->vertices[index].name = (char*)malloc(strlen(name) + 1);
    strcpy(g->vertices[index].name, name);
    g->n++;
}

void add_edge(Graph* g, char* from, char* to, int weight) {
    int i, j;
    i = get_vertex_index(g, from);
    j = get_vertex_index(g, to);
    g->edges[i][j] = weight;
    g->edges[j][i] = weight;
}

void init(Graph* g) {
    int i, j;
    for (i = 0; i < g->n; i++) {
        for (j = 0; j < g->n; j++) {
            g->edges[i][j] = INF;
        }
    }
}

void dijkstra(Graph* g, int start, int* dist, int* prev) {
    int i, j, k;
    int visited[MAX_VERTICES] = { 0 };
    for (i = 0; i < g->n; i++) {
        dist[i] = g->edges[start][i];
        visited[i] = 0;
        if (dist[i] == INF) {
            prev[i] = -1;
        }
        else {
            prev[i] = start;
        }
    }
    dist[start] = 0;
    visited[start] = 1;

    for (i = 1; i < g->n; i++) {
        int min_dist = INF;
        for (j = 0; j < g->n; j++) {
            if (!visited[j] && dist[j] < min_dist) {
                min_dist = dist[j];
                k = j;
            }
        }
        visited[k] = 1;

        for (j = 0; j < g->n; j++) {
            if (!visited[j] && g->edges[k][j] != INF && dist[k] + g->edges[k][j] < dist[j]) {
                dist[j] = dist[k] + g->edges[k][j];
                prev[j] = k;
            }
        }
    }
}

void print_path(Graph* g, int* prev, int start, int end) {
    if (prev[end] != -1 && end != start) {
        print_path(g, prev, start, prev[end]);
    }
    printf("%s", g->vertices[end].name);
    if (end != start) {
        printf(" -> ");
    }
}

void shortest_path(Graph* g, char* from, char* to) {
    int dist[MAX_VERTICES];
    int prev[MAX_VERTICES];
    int start = get_vertex_index(g, from);
    int end = get_vertex_index(g, to);
    dijkstra(g, start, dist, prev);
    printf("Shortest path from %s to %s: ", from, to);
    print_path(g, prev, start, end);
    printf("\n");
}

int main() {
    Graph g;
    g.n = 0;

    add_vertex(&g, "A");
    add_vertex(&g, "B");
    add_vertex(&g, "C");
    add_vertex(&g, "D");
    add_vertex(&g, "E");
    add_vertex(&g, "F");

    init(&g);

    add_edge(&g, "A", "B", 2);
    add_edge(&g, "A", "C", 5);
    add_edge(&g, "B", "C", 1);
    add_edge(&g, "B", "D", 6);
    add_edge(&g, "C", "D", 2);
    add_edge(&g, "C", "E", 4);
    add_edge(&g, "D", "E", 1);
    add_edge(&g, "D", "F", 3);
    add_edge(&g, "E", "F", 5);

    shortest_path(&g, "A", "F");

    return 0;
}

该代码实现了一个简单的校园导航系统，包括地图数据结构和导航算法实现。在使用时，需要先添加景点和路径信息，然后调用shortest_path函数实现最短路径查询。