图的综合应用!.docVIP

图的综合应用·········· #include stdio.h #include string.h #include stdlib.h #include conio.h #define max 100 #define Maxsize (131-1) int visited[max]={0}; //邻接表结构 typedef struct arc { int adjvex; struct arc *nextarc; }Arcnode; typedef struct vnode { char data; Arcnode *firstarc; }Vnode,adjlist[max]; typedef struct { adjlist vertices; int vexnum,arcnum; }Graph; //有向网邻接矩阵结构 typedef struct { double adj; //弧上权值 }Adj[max][max]; typedef struct { Adj arcs; char vexs[max]; int vexnum,arcnum; }Net; //广度遍历所需队列 typedef struct { char *data; int front,rear; }seqqueue; int initqueue(seqqueue q) { q.data=(char *)malloc(max * sizeof(char)); if(q.data==NULL) exit(0); q.front=q.rear=0; return 1; } int Enqueue(seqqueue q,int v) { if((q.rear+1)%max==q.front) { printf(队满!\n); return 0;} q.data[q.rear]=v; q.rear=(q.rear+1)%max; return 1; } int Dequeue(seqqueue q,int v) { if(q.rear==q.front) { printf(空队!\n); return 0; } v=q.data[q.rear]; q.rear=(q.rear+1)%max; return 1; } //创建有向图邻接表 void creategraph1(Graph G) { int i,j,k; Arcnode *p; printf(输入顶点数和边数:); scanf(%c%c,G.vexnum,G.arcnum); printf(输入节点信息:); for(i=1;i=G.vexnum;i++) { scanf(%c,G.vertices[i].data); G.vertices[i].firstarc=NULL; } for(k=0;kG.arcnum;k++) { printf(输入两顶点:); scanf(%d%d,i,j); p=(Arcnode *)malloc(sizeof(Arcnode)); if(p==NULL) exit(0); p-adjvex=j; p-nextarc=G.vertices[i].firstarc; G.vertices[i].firstarc=p; } //若是无向图，则加上这几个语句 //q=(Arcnode *)malloc(sizeof(Arcnode)); // if(q==NULL) exit(0); // q-adjvex=i; // q-nextarc=G.vertices[j].firstarc; // G.vertices[j].firstarc=q; } //创建有向网邻接矩阵 void createNet(Net N) { int i,j,k,w; printf(输入顶点数和边数:); scanf(%d%d,N.vexnum,N.arcnum); getchar(); for(i=1;i=N.vexnum;i++) { scanf(%c,N.vexs[i]); getchar();} for(i=1;i=N.vexnum;i++) for(j=1;j=N.vexnum;j++) N.arcs[i][j].adj=Maxsize; for(k=0;kN.arcnum;k++) { printf(输入两顶点和弧上权值:); scanf(%d%d%d,i,j,w); N.arcs[i][j].adj=w; }