• 安阳旅游地图

    1. #include <stdio.h>
    2. #include <stdlib.h>
    3. #include <string.h>
    4. #include <stdbool.h>
    5. #define MaxNum 10
    6. #define INFINITY 9999
    7. #define MaxStringLength 100
    8.  
    9. typedef struct GNode {
    10.     int NumVertex;
    11.     int NumEdge;
    12.     int Vertexs[MaxNum][MaxNum];
    13.     char VertexData[MaxNum][MaxStringLength];
    14. } Graph;
    15.  
    16. typedef struct view{
    17. 	char viewname[100];
    18. 	char viewinformation[1000];
    19. }view;
    20. void enter(view v[],char*name,char*information,int i){
    21. 		strcpy(v[i].viewname,name);
    22. 		strcpy(v[i].viewinformation,information);
    23. }
    24. void print_view(view v[]){
    25. 	for(int i=0;i<10;i++){
    26. 		printf("景点名称：%s\n",v[i].viewname);
    27. 		printf("景点介绍：%s\n",v[i].viewinformation);
    28. 		printf("\n");
    29. 	}
    30. }
    31. void visit(Graph* graph, int vertex) {
    32.     printf("%s ", graph->VertexData[vertex]);
    33. }
    34.  
    35. Graph* Make_Graph(int NumVertex, int NumEdge) {
    36.     Graph* graph = (Graph*)malloc(sizeof(Graph));
    37.     graph->NumVertex = NumVertex;
    38.     graph->NumEdge = 0;
    39.     for (int i = 0; i < NumVertex; i++) {
    40.         for (int j = 0; j < NumVertex; j++) {
    41.             graph->Vertexs[i][j] = 0;
    42.         }
    43.     }
    44.     return graph;
    45. }
    46.  
    47. void Add_Edge(Graph* graph, int vertex1, int vertex2, int weight) {
    48.     if (graph == NULL || graph->NumVertex == 0) {
    49.         printf("error");
    50.         return;
    51.     }
    52.     graph->Vertexs[vertex1][vertex2] = weight;
    53.     graph->Vertexs[vertex2][vertex1] = weight;
    54. }
    55.  
    56. void Add_Vertex_Data(Graph* graph, int vertex, char* name) {
    57.     if (graph == NULL || vertex > graph->NumVertex - 1 || vertex < 0) {
    58.         printf("error");
    59.         return;
    60.     }
    61.     strcpy(graph->VertexData[vertex], name);
    62. }
    63.  
    64. void DFS(Graph* graph, int vertex, void (*visit)(Graph*, int), bool visited[]) {
    65.     visit(graph, vertex);
    66.     visited[vertex] = true;
    67.     for (int i = 0; i < graph->NumVertex; i++) {
    68.         if (graph->Vertexs[vertex][i] != 0 && !visited[i] && graph->Vertexs[vertex][i] != INFINITY) {
    69.             DFS(graph, i, visit, visited);
    70.         }
    71.     }
    72. }
    73.  
    74. void dijkstra(Graph* graph, int start, bool visited[]) {
    75.     int T[MaxNum][2];
    76.     for (int i = 0; i < graph->NumVertex; i++) {
    77.         T[i][0] = INFINITY;
    78.         T[i][1] = -1;
    79.         visited[i] = false;
    80.     }
    81.     T[start][0] = 0;
    82.     T[start][1] = -1;
    83.     for (int i = 0; i < graph->NumVertex - 1; i++) {
    84.         int mindist = INFINITY;
    85.         int minindex = -1;
    86.         for (int j = 0; j < graph->NumVertex; j++) {
    87.             if (!visited[j] && T[j][0] < mindist) {
    88.                 mindist = T[j][0];
    89.                 minindex = j;
    90.             }
    91.         }
    92.         visited[minindex] = true;
    93.         for (int k = 0; k < graph->NumVertex; k++) {
    94.             if (!visited[k] && graph->Vertexs[minindex][k] != 0 && T[minindex][0] + graph->Vertexs[minindex][k] < T[k][0]) {
    95.                 T[k][0] = T[minindex][0] + graph->Vertexs[minindex][k];
    96.                 T[k][1] = minindex;
    97.             }
    98.         }
    99.     }
    100.     int end;
    101.     printf("请输入目的地编号：");
    102.     scanf("%d", &end);
    103.     printf("最短距离为：%dkm\n", T[end][0]);
    104.     printf("最短路线为：%s ", graph->VertexData[end]);
    105.     int temp = T[end][1];
    106.     while (temp != -1) {
    107.         printf("<- %s ", graph->VertexData[temp]);
    108.         temp = T[temp][1];
    109.     }
    110. }
    111.  
    112. int main() {
    113.     bool visited[MaxNum];
    114.     for (int i = 0; i < MaxNum; i++) {
    115.         visited[i] = false;
    116.     }
    117.     int NumVertex = 10;
    118.     int NumEdge = 19;
    119.     Graph* graph = Make_Graph(NumVertex, NumEdge);
    120.     for (int i = 0; i < NumVertex; i++) {
    121.         char* name = (char*)malloc(sizeof(char) * 100);
    122.         printf("请输入%d号景点的名称：\n", i);
    123.         scanf("%s", name);
    124.         Add_Vertex_Data(graph, i, name);
    125.     }
    126.     for (int i = 0; i < NumEdge; i++) {
    127.         int v1, v2, weight;
    128.         printf("请输入两个景点的编号和距离：\n");
    129.         scanf("%d %d %d", &v1, &v2, &weight);
    130.         printf("从%d号景点到%d号景点的距离%d:\n", v1, v2, weight);
    131.         Add_Edge(graph, v1, v2, weight);
    132.         printf("\n\n");
    133.     };
    134.     view v[10];
    135.     for(int i=0;i<10;i++){
    136.     	char*name=(char*)malloc(sizeof(char)*100);
    137.     	char*information=(char*)malloc(sizeof(char)*1000);
    138.     	printf("请输入景点名称："); 
    139.     	scanf("%s",name);
    140.     	printf("请输入景点信息：");
    141.     	scanf("%s",information);
    142. 		enter(v,name,information,i); 
    143. 	}
    144.     printf("\n\n");
    145.     int choice;
    146. 	int start;
    147.     do{
    148.     	
    149.         printf("                                                                               \n");
    150.         printf("                                                                               \n");                                 
    151.         printf("                  |-------------0殷墟------1袁林-------2中国文字博物馆         \n");
    152.         printf("                  |              |                  |             |            \n");
    153.         printf("6红旗渠------------              |                  |             |            \n");
    154.         printf("    |             |              |---------------4羑里城-----------            \n");
    155.         printf("    |             |              |                  |             |            \n");
    156.         printf("    |             |              |                  |             |            \n");
    157.         printf("7太行大峡谷-------|-------------3长春观----------5岳飞庙-------   |            \n");
    158.         printf("                                                    |         |   |            \n");
    159.         printf("                                                    |          8二帝陵         \n");
    160.         printf("                                                    |             |            \n");
    161.         printf("                                                    |             |            \n");
    162.         printf("                                                    |----------9明福寺         \n");
    163.         printf("                                                                               \n");
    164.         printf("                                                                               \n");
    165.         printf("*******************************河南安阳旅游地图********************************\n");
    166.         printf("                                                                               \n");
    167.     	printf("              【1】景点名称及相关信息\n");
    168.     	printf("              【2】深度遍历景点\n");
    169. 		printf("              【3】获取最短路径\n");
    170. 		printf("               请输入你的选项：\n");
    171. 		scanf("%d",&choice);
    172. 		printf("\n\n\n");
    173. 		if(choice==1){
    174. 			print_view(v);
    175. 		} 
    176. 		if(choice==2){
    177. 			int num;
    178. 			printf("请输入作为遍历起点的景点编号：");
    179. 			scanf("%d",&num);
    180. 			DFS(graph, num, visit, visited);
    181. 			printf("\n");
    182. 		}
    183. 		if(choice==3){
    184. 			printf("请输入出发地地点编号：\n");
    185.             scanf("%d", &start);
    186.             dijkstra(graph, start, visited);
    187.             printf("\n");
    188. 		}
    189. 	}while(choice!=0);
    190.     return 0;
    191. }

    殷墟
    袁林
    文字博物馆
    长春观
    羑里城
    岳飞庙
    红旗渠
    太行大峡谷
    二帝陵
    明福寺
    0 1 5
    0 2 8
    0 3 30
    0 4 20
    0 6 70
    1 2 5
    1 4 20
    2 4 20
    2 8 75
    3 4 40
    3 5 35
    3 6 60
    3 7 30
    4 5 5
    4 8 60
    5 8 55
    5 9 60
    6 7 30
    8 9 40
    殷墟
    殷墟，河南安阳的商朝都城遗址，重要考古发现包括甲骨文，推动了中国信史进展。
    袁林
    袁林，又称袁坟，是清末民初政治家袁世凯的墓地，位于河南省安阳市。墓地规模宏大，建筑风格独特，是近现代重要史迹及代表性建筑。
    文字博物馆
    中国文字博物馆是一座位于河南省安阳市的国家级博物馆，以汉字为主题，展示汉字的起源、发展、演变和应用。博物馆旨在收藏、研究、展示和阐释中华优秀语言文化
    长春关
    河南安阳长春观，道教全真派宫观，历史悠久，明清建筑风格，供奉道教神祇。
    羑里城
    羑里城，位于河南安阳，是中国最古老的监狱之一，有“司法博物馆”之称。
    岳飞庙
    纪念南宋抗金名将岳飞，建筑精美，存有岳飞文物，为爱国主义教育场所。
    红旗渠
    红旗渠，位于河南林州，是新中国成立后人民自力更生、艰苦奋斗的典范，人工修建的大型灌区，被誉为“人工天河”。
    太行大峡谷
    太行大峡谷，位于河南林州，是太行山内的壮观峡谷，自然景观丰富，有“奇峰万矗”之美誉，是一处著名的自然风光旅游区。
    二帝陵
    二帝陵，位于河南省安阳市，是相传中华民族的人文始祖炎帝神农氏和黄帝轩辕氏的陵墓，是中华文明的重要遗迹。
    明福寺
    明福寺，位于中国河南省安阳市，是一座历史悠久的佛教寺庙，始建于唐代，经历代维修和扩建，寺内保存有珍贵的文物和佛教艺术品，是安阳市的重要佛教文化和历史遗迹。

    1. #include <stdio.h>
    2. #include <stdlib.h>
    3. #include <string.h>
    4. #include <stdbool.h>
    5. #define MaxNum 10
    6. #define INFINITY 9999
    7. #define MaxStringLength 100
    8.  
    9. typedef struct GNode {
    10.     int NumVertex;
    11.     int NumEdge;
    12.     int Vertexs[MaxNum][MaxNum];
    13.     char VertexData[MaxNum][MaxStringLength];
    14. } Graph;
    15.  
    16. typedef struct view{
    17. 	char viewname[1000];
    18. 	char viewinformation[10000];
    19. }view;
    20. void enter(view v[],char*name,char*information,int i){
    21. 		strcpy(v[i].viewname,name);
    22. 		strcpy(v[i].viewinformation,information);
    23. }
    24. void print_view(view v[]){
    25. 	for(int i=0;i<10;i++){
    26. 		printf("景点名称：%s\n",v[i].viewname);
    27. 		printf("景点介绍：%s\n",v[i].viewinformation);
    28. 		printf("\n");
    29. 	}
    30. }
    31.  
    32. void visit(Graph* graph, int vertex) {
    33.     printf("%s ", graph->VertexData[vertex]);
    34. }
    35.  
    36. Graph* Make_Graph(int NumVertex, int NumEdge) {
    37.     Graph* graph = (Graph*)malloc(sizeof(Graph));
    38.     graph->NumVertex = NumVertex;
    39.     graph->NumEdge = 0;
    40.     for (int i = 0; i < NumVertex; i++) {
    41.         for (int j = 0; j < NumVertex; j++) {
    42.             graph->Vertexs[i][j] = 0;
    43.         }
    44.     }
    45.     return graph;
    46. }
    47.  
    48. void Add_Edge(Graph* graph, int vertex1, int vertex2, int weight) {
    49.     if (graph == NULL || graph->NumVertex == 0) {
    50.         printf("error");
    51.         return;
    52.     }
    53.     graph->Vertexs[vertex1][vertex2] = weight;
    54.     graph->Vertexs[vertex2][vertex1] = weight;
    55. }
    56.  
    57. void Add_Vertex_Data(Graph* graph, int vertex, char* name) {
    58.     if (graph == NULL || vertex > graph->NumVertex - 1 || vertex < 0) {
    59.         printf("error");
    60.         return;
    61.     }
    62.     strcpy(graph->VertexData[vertex], name);
    63. }
    64.  
    65. void DFS(Graph* graph, int vertex, void (*visit)(Graph*, int), bool visited[]) {
    66.     visit(graph, vertex);
    67.     visited[vertex] = true;
    68.     for (int i = 0; i < graph->NumVertex; i++) {
    69.         if (graph->Vertexs[vertex][i] != 0 && !visited[i] && graph->Vertexs[vertex][i] != INFINITY) {
    70.             DFS(graph, i, visit, visited);
    71.         }
    72.     }
    73. }
    74.  
    75. void dijkstra(Graph* graph, int start, bool visited[]) {
    76.     int T[MaxNum][2];
    77.     for (int i = 0; i < graph->NumVertex; i++) {
    78.         T[i][0] = INFINITY;
    79.         T[i][1] = -1;
    80.         visited[i] = false;
    81.     }
    82.     T[start][0] = 0;
    83.     T[start][1] = -1;
    84.     for (int i = 0; i < graph->NumVertex - 1; i++) {
    85.         int mindist = INFINITY;
    86.         int minindex = -1;
    87.         for (int j = 0; j < graph->NumVertex; j++) {
    88.             if (!visited[j] && T[j][0] < mindist) {
    89.                 mindist = T[j][0];
    90.                 minindex = j;
    91.             }
    92.         }
    93.         visited[minindex] = true;
    94.         for (int k = 0; k < graph->NumVertex; k++) {
    95.             if (!visited[k] && graph->Vertexs[minindex][k] != 0 && T[minindex][0] + graph->Vertexs[minindex][k] < T[k][0]) {
    96.                 T[k][0] = T[minindex][0] + graph->Vertexs[minindex][k];
    97.                 T[k][1] = minindex;
    98.             }
    99.         }
    100.     }
    101.     int end;
    102.     printf("请输入目的地编号：");
    103.     scanf("%d", &end);
    104.     printf("最短距离为：%dkm\n", T[end][0]);
    105.     printf("最短路线为：%s ", graph->VertexData[end]);
    106.     int temp = T[end][1];
    107.     while (temp != -1) {
    108.         printf("<- %s ", graph->VertexData[temp]);
    109.         temp = T[temp][1];
    110.     }
    111. }
    112.  
    113. int main() { 
    114. 	FILE *fp;
    115. 	fp=fopen("data.txt","r");
    116.     bool visited[MaxNum];
    117.     for (int i = 0; i < MaxNum; i++) {
    118.         visited[i] = false;
    119.     }
    120.     int NumVertex = 10;
    121.     int NumEdge = 19;
    122.     Graph* graph = Make_Graph(NumVertex, NumEdge);
    123.     for (int i = 0; i < NumVertex; i++) {
    124.         char* name = (char*)malloc(sizeof(char) * 100);
    125.         printf("请输入%d号景点的名称：\n", i);
    126.         fscanf(fp,"%s", name);
    127.         Add_Vertex_Data(graph, i, name);
    128.     }
    129.     for (int i = 0; i < NumEdge; i++) {
    130.         int v1, v2, weight;
    131.         printf("请输入两个景点的编号和距离：\n");
    132.         fscanf(fp,"%d %d %d", &v1, &v2, &weight);
    133.         printf("从%d号景点到%d号景点的距离%d:\n", v1, v2, weight);
    134.         Add_Edge(graph, v1, v2, weight);
    135.         printf("\n\n");
    136.     };
    137.     view v[10];
    138.     for(int i=0;i<10;i++){
    139.     	char*name=(char*)malloc(sizeof(char)*100);
    140.     	char*information=(char*)malloc(sizeof(char)*1000);
    141.     	printf("请输入景点名称："); 
    142.     	fscanf(fp,"%s",name);
    143.     	printf("请输入景点信息：");
    144.     	fscanf(fp,"%s",information);
    145. 		enter(v,name,information,i); 
    146. 	}
    147.     printf("\n\n");
    148.     int choice;
    149. 	int start;
    150. 	system("cls");
    151.     do{
    152.     	
    153.         printf("                                                                               \n");
    154.         printf("                                                                               \n");                                 
    155.         printf("                  |-------------0殷墟------1袁林-------2中国文字博物馆         \n");
    156.         printf("                  |              |                  |             |            \n");
    157.         printf("6红旗渠------------              |                  |             |            \n");
    158.         printf("    |             |              |---------------4羑里城-----------            \n");
    159.         printf("    |             |              |                  |             |            \n");
    160.         printf("    |             |              |                  |             |            \n");
    161.         printf("7太行大峡谷-------|-------------3长春观----------5岳飞庙-------   |            \n");
    162.         printf("                                                    |         |   |            \n");
    163.         printf("                                                    |          8二帝陵         \n");
    164.         printf("                                                    |             |            \n");
    165.         printf("                                                    |             |            \n");
    166.         printf("                                                    |----------9明福寺         \n");
    167.         printf("                                                                               \n");
    168.         printf("                                                                               \n");
    169.         printf("*******************************河南安阳旅游地图********************************\n");
    170.         printf("                                                                               \n");
    171.     	printf(" 【1】景点名称及相关信息\n");
    172.     	printf(" 【2】深度遍历景点\n");
    173. 		printf(" 【3】获取最短路径\n");
    174. 		printf(" 【0】退出程序\n"); 
    175. 		printf("  请输入你的选项：");
    176. 		scanf("%d",&choice);
    177. 		printf("\n\n\n");
    178. 		if(choice==1){
    179. 			print_view(v);
    180. 			printf("\n");
    181. 		}else if(choice==2){
    182. 			int num;
    183. 			printf("请输入作为遍历起点的景点编号：");
    184. 			scanf("%d",&num);
    185. 			DFS(graph, num, visit, visited);
    186. 		}else if(choice==3){
    187. 			printf("请输入出发地地点编号：");
    188.             scanf("%d", &start);
    189.             dijkstra(graph, start, visited);
    190.             printf("\n");
    191. 		}else if(choice==0){
    192. 			printf("谢谢使用！\n");
    193. 			break;
    194. 		}else{
    195. 			printf("无效选择，请再次选择\n");
    196. 		}
    197. 	}while(choice!=0);
    198. 	fclose(fp);
    199.     return 0;
    200. }

  • 相关阅读:
    超详细的文件上传和下载(Spring Boot)
    React几种避免子组件无效刷新的方案
    linux tasks errors
    学习c语言第24天（练习）
    AC发声：我踩过的坑 你们都（别再）踩了
    vue,Promise备忘
    【Git 全功能解析: 探索版本控制的强大工具】
    iOS 17.0 UIGraphicsBeginImageContextWithOptions 崩溃处理
    Linux操作系统(基础操作)
    ELK之Logstash启动异常：Logstash could not be started because there is already...
  • 原文地址：https://blog.csdn.net/2302_80380793/article/details/137886885