旅游景点线路模拟系统

/**********************//*旅游景点线路模拟系统*//**********************/# include"stdio.h"# include"string.h"typedef int VRType;typedef char* VertexType;int visited[20];struct {VertexType adjvex; // U集中的顶点序号VRType lowcost; // 边的权值} closedge[20];/*数组（邻接矩阵）存储*/typedef struct { // 弧（或边）VRType adj; //表示弧（或边）的信息—权；} NetArc,AdjMatrix[20][20];typedef struct{//网的定义VertexType vexs[20]; //顶点信息//int vex[20];//访问信息AdjMatrix arcs; //邻接矩阵int vexnum, arcnum; //顶点数目和弧（或边）数目}Net;/*队列定义*/typedef int ElemType;typedef int Status;typedef struct {ElemType *base;int front;int rear;int queuesize;} SqQueue;Status InitQueue (SqQueue &Q) {Q.base = new ElemType[50];//if (!Q.base) exit (OVERFLOW);Q.queuesize = 50;Q.front = Q.rear = 0;return 1;}Status EnQueue (SqQueue &Q, ElemType e) {if ((Q.rear+1) % Q.queuesize == Q.front)return 0;Q.base[Q.rear] = e;Q.rear = (Q.rear+1) % Q.queuesize;return 1;}Status DeQueue (SqQueue &Q, ElemType &e) {if (Q.front == Q.rear) return 0;e = Q.base[Q.front];Q.front = (Q.front+1) % Q.queuesize;return 1;}/*图的邻接矩阵创建*/void Creatnet(Net &G){int i,j,k;int w;printf("数组（邻接矩阵）存储\n");printf("请输入顶点数和弧数：");scanf("%d%d",&G.vexnum,&G.arcnum);// 顶点数和弧数printf("请输入顶点信息：");for(i=0;i<G.vexnum;i++){G.vexs[i] = new char[20];scanf("%s",G.vexs[i]);}for(i=0;i<G.vexnum;i++)for(j=0;j<G.vexnum;j++)G.arcs[i][j].adj= 1000;printf("请输入弧及其权值(eg:2 3 23.4 矩阵中(2,3)权值为.4)：\n");for(k=0;k<G.arcnum;k++){scanf("%d%d%d",&i,&j,&w);// 读入一条弧和弧上的权值G.arcs[i-1][j-1].adj=w;}}/*寻找v的第一个结点*/int FirstAdjVex(Net G,int v){int i;for (i = 0; i < G.vexnum; i++)if(visited[i]==0&&G.arcs[v][i].adj!=1000)return i;return -1;}/*寻找v的下一个结点*/int NextAdjVex(Net G,int v,int w){int i;for(i =w; i < G.vexnum; i++)if(visited[i]==0&&G.arcs[v][i].adj!=1000)return i;return -1;}/*深度优先遍历(递归)*/void DFS(Net G,int v){int w;visited[v]=1;//VisitFunc(v);printf("%s ",G.vexs[v]);//访问第v个顶点for(w=FirstAdjVex(G,v);w!=-1;w=NextAdjVex(G,v,w))if(!visited[w])DFS(G,w);//对v的尚未访问的邻接顶点w递归调用DFS }/*找到u在矩阵中的序号*/int LocateVex ( Net G,char* u ){int i;for (i=0;i<G.vexnum;i++){if (strcmp(u,G.vexs[i])==0){return i;}}return -1;}/*广度优先遍历*/void BFS(Net G,int k)SqQueue Q;int u,w,v;for (v=0; v<G.vexnum; ++v)visited[v] = 0; //初始化访问标志InitQueue(Q); // 置空的辅助队列Qfor ( v=k; v<G.vexnum; ++v )if ( !visited[v]) { // v 尚未访问visited[v] = 1;printf("%s ",G.vexs[v]);//访问第v个顶点EnQueue(Q, v); // v入队列while (Q.front!=Q.rear) {DeQueue(Q, u);// 队头元素出队并置为ufor(w=FirstAdjVex(G, u); w!=-1; w=NextAdjVex(G,u,w))if ( ! visited[w]) {visited[w]=1;printf("%s ",G.vexs[w]);//访问第w个顶点EnQueue(Q, w); // 访问的顶点w入队列} // if} // while}}// BFSTraversevoid Printall(Net G){int i,j;printf(" ");for (i=0;i<G.vexnum;i++)printf("%8s",G.vexs[i]);printf("\n");for (j=0;j<G.vexnum;j++){printf("%8s",G.vexs[j]);for (i=0;i<G.vexnum;i++)if (G.arcs[j][i].adj==1000)printf(" ");elseprintf("%8d",G.arcs[j][i].adj);printf("\n");}}int minimum(Net G)// 求出加入生成树的下一个顶点(k)int i,closedgemin;closedgemin=closedge[0].lowcost;for (i=0;i<G.vexnum;i++) {if ( closedge[i].lowcost != 1000 && closedge[i].lowcost < closedgemin ) { closedgemin=closedge[i].lowcost;}}for (i=0;i<G.vexnum;i++){if (closedge[i].lowcost==closedgemin)return i;}}/*最小生成树(prim)*/void MiniSpanTree_P(Net G, VertexType u) //用普里姆算法从顶点u出发构造网G的最小生成树{int j,k,i,x;k = LocateVex ( G, u );for ( j=0; j<G.vexnum; ++j ) // 辅助数组初始化if (j!=k){//不邻接的lowcost为m//closedge[j] = { u, G.arcs[k][j].adj };//strcpy(closedge[j].adjvex,u);closedge[j].adjvex=u;closedge[j].lowcost=G.arcs[k][j].adj;}closedge[k].lowcost = 1001; // 初始，U＝{u}for (i=0; i<G.vexnum-1; ++i){x=minimum(G);printf("%s-->%d-->%s\n",closedge[x].adjvex,closedge[x].lowcost, G.vexs[x]);// 输出生成树上一条边k=x;closedge[k].lowcost = 1001; // 第k顶点并入U集for (j=0; j<G.vexnum; ++j) //修改其它顶点的最小边if (closedge[j].lowcost!=1001&&G.arcs[k][j].adj < closedge[j].lowcost){closedge[j].adjvex=G.vexs[k];closedge[j].lowcost=G.arcs[k][j].adj;}}}//最短路径(Floyd算法)void ShortestPath_Floyd(Net G){//i和j之间的最短路径为p[i][j]，最短路径长为D[i][j]；若//p[i][j][k]为TRUE，则k是从i到j当前求得最短路径上的顶点int P[30][30][30];int D[30][30];int v,w,u,i,j;for(v=0;v<G.vexnum;v++)//各对结点间初始已知路径及距离{for(w=0;w<G.vexnum;w++){D[v][w]=G.arcs[v][w].adj;for(u=0;u<G.vexnum;u++)P[v][w][u]=0;if(D[v][w]<1000)//v到w有直接路径{P[v][w][v]=1;P[v][w][w]=1;}}}for(u=0;u<G.vexnum;u++)for(v=0;v<G.vexnum;v++)for(w=0;w<G.vexnum;w++)if(D[v][u]+D[u][w]<D[v][w])//从v经u到w的一条路径更短{D[v][w]=D[v][u]+D[u][w];for(i=0;i<G.vexnum;i++)P[v][w][i]=P[v][u][i]||P[u][w][i];}for (i=0;i<G.vexnum;i++)for (j=0;j<G.vexnum;j++){if(i!=j)printf("MIN(%s,%s)=%d\n",G.vexs[i],G.vexs[j],D[i][j]);}}//最短路径(Dijkstra算法)void ShortestPath_Dij(Net G,int v0){//用Dijkstra算法求有向网G的v0顶点到其余顶点v的最短路径P[v]及其带权长度D[v] //若P[v][w]为TRUE，则w是v0到v的当前求的最短路径上的顶点//final[v]为TRUE当且仅当v属于S，即已求得从v0到v的最短路径VRType minnum;int v,w,i;int final[30],D[30];int P[30][30];for (v=0;v<G.vexnum;v++){final[v]=0;D[v]=G.arcs[v0][v].adj;for (w=0;w<G.vexnum;w++)//设空路径P[v][w]=0;if (D[v]<1000){P[v][v0]=1;P[v][v]=1;}}//初始化，v0属于S集D[v0]=0;final[v0]=1;//主循环，每次求的v0到某个v的最短路径，并加v到S集for (i=1;i<G.vexnum;i++)//其余G.vexnum-1个顶点{minnum=1000;//当前所知离v0顶点的最近顶点for (w=0;w<G.vexnum;w++)if (!final[w])//w在V-S中if (D[w]<minnum)//w离v0更近{v=w;minnum=D[w];}final[v]=1;//离v0顶点最近的v加入S集for (w=0;w<G.vexnum;w++)//更新当前最短路径及距离if (!final[w]&&(minnum+G.arcs[v][w].adj<D[w])){D[w]=minnum+G.arcs[v][w].adj;//P[w]=P[v];P[w][w]=1;}}for (i=0;i<G.vexnum;i++){printf("MIN(%s,%s)=%d\n",G.vexs[v0],G.vexs[i],D[i]); }}void main(){Net G;char* exp=new char[20];int c,i,x,k=0;while(1){printf("\n**********************************");printf("\n*******旅游景点路线模拟系统*******");printf("\n**********************************\n");printf("**1.创建景点信息 ********\n");printf("**2.深度优先遍历景点 ********\n");printf("**3.广度优先遍历景点 ********\n");printf("**4.搜索景点间最短路线 ********\n");printf("**5.最小生成树 ********\n");printf("**6.输出景点信息邻接矩阵 ********\n");printf("**0.退出 ********\n");printf("请选择：");scanf("%d",&c);if(c==0)break;switch(c){case 1:Creatnet(G);break;case 2:for (i=0;i<G.vexnum;i++)visited[i]=0;printf("请输入开始查找景点位置：");scanf("%s",exp);for (i=0;i<G.vexnum;i++)if (strcmp(exp,G.vexs[i])==0)x=i;DFS(G,x);for (i=0;i<G.vexnum;i++)if (visited[i]==0)DFS(G,i);break;case 3:printf("请输入开始查找景点位置：");scanf("%s",exp);for (i=0;i<G.vexnum;i++)if (strcmp(exp,G.vexs[i])==0)x=i;BFS(G,x);for (i=0;i<G.vexnum;i++)if (visited[i]==0)BFS(G,i);break;case 4:printf("1.Dijkstra算法\n2.Floyd算法\n请选择：");scanf("%d",&k);if (k==1){printf("请输入起始顶点名称：");scanf("%s",exp);ShortestPath_Dij(G,LocateVex(G,exp));}else if (k==2)ShortestPath_Floyd(G);break;case 5:printf("请输入最小生成树起始点：");scanf("%s",exp);MiniSpanTree_P(G,exp);break;case 6:Printall(G);break;}}}/*7 22a b c d e f g1 2 19 2 1 19 2 3 5 3 2 5 3 4 3 4 3 3 4 5 8 5 4 8 5 7 16 7 5 16 1 7 18 7 1 18 6 7 27 7 6 27 4 6 21 6 4 21 1 5 14 5 1 14 2 5 12 5 2 12 2 4 7 4 2 7*/。