数据结构课程设计之图的基本操作与应用的源程序

g.arcs[g.a[k]-1][g.b[k]-1]=1;
printf_adjmatrix(g);
}
void create_1(graph g){
int i,j,k,c=0;
for (i=0;i<g.vexnum;i++)
for(j=0;j<g.vexnum;j++)
edgenode *p;
visit[i]=1;
printf("%c ",adjl.adjs[i].data);
for(p=adjl.adjs[i].link;p;p=p->next){
if(!visit[p->adjvex]) DFS(adjl,p->adjvex);
g.arcs[i][j]=c;
for (k=0;k<g.arcnum;k++)
{ g.arcs[g.a[k]-1][g.b[k]-1]=g.h[k];
g.arcs[g.b[k]-1][g.a[k]-1]=g.h[k];
}
printf_adjmatrix(g);
# define null 0
typedef int status;
#include <ctype.h>
#include <string.h>
#include <queue>
#include <stack>
#include <process.h>
using namespace std;
for(i=0;i<g.vexnum;i++)
{ printf("[%d,%c]=>",i+1,adjl.adjs[i].data);
p=adjl.adjs[i].link;
while(p!=null)
{printf("[%c,%d]-->",adjl.adjs[(p->adjvex)-1].data,p->info);
}
graph create_4(graph g){
int i,j,k,c=999;
for (i=0;i<g.vexnum;i++)
for(j=0;j<g.vexnum;j++)
g.arcs[i][j]=c;
for(k=0;k<g.arcnum;k++)
(p->front)->next=null;
}
status empty(linkqueue *q){int v;
if(q->front==q->rear) v=true;
else v=false;
return v;
}
int addqueue(linkqueue *q,int e){
typedef struct{
vexnode adjs[maxlen];
int vexnum,arcnum;
int kind;
}adjlist;
typedef struct qnode{
int data;
struct qnode *next;
}linkqlist;
typedef struct
}
status delqueue(linkqueue *q){
linkqlist *p;
int e;
if (q->front==q->rear)
printf("the linklist is overflow");
else p=(q->front)->next;
p->info=g.h[i];
p->adjvex=g.a[i];
p->next=adjl.adjs[g.b[i]-1].link;
adjl.adjs[g.b[i]-1].link=p;
}
}
printf("邻接表为:\n");
(q->front)->next=p->next;
e=p->data;
if(q->rear==p)
q->rear=q->front;
free(p);
return(e);
}
bool visit[maxlen];//深度优先搜索
void DFS(adjlist adjl,int i){
if(!visit[w->adjvex]){
visit[w->adjvex]=1;
printf("%c ",adjl.adjs[w->adjvex-1].data);
Q.push(w->adjvex);
}
}
}
}
}
#define MAX_VERTEX_NUM 20
#define MAX 1000
typedef struct{
int a[maxlen],b[maxlen],h[maxlen];
char vexs[maxlen];
int vexnum,arcnum;
int kind;
int arcs[maxlen][maxlen];
adjl.adjs[g.a[i]-1].link=p;
}
}
if(g.kind==2||g.kind==4)
{ for(i=0;i<adjl.arcnum;i++)
{ p=(edgenode*)malloc(sizeof(edgenode));
p->info=g.h[i];
p=p->next;
}
printf("^\n");
}
return adjl;
}
void initqueue(linkqueue *p){
p->front=(linkqlist *)malloc(sizeof(linkqlist));
p->rear=p->front;
}
}
void DFSTraverse(adjlist adjl){
int i;
printf("\t\t深度优先搜索 :");
for( i=0;i<maxlen;i++)
visit[i]=false;
for( i=0;i<=adjl.vexnum;i++)
if(!visit[i]) DFS(adjl,i);
{ for(i=0;i<adjl.arcnum;i++)
{ p=(edgenode*)malloc(sizeof(edgenode));
p->adjvex=g.b[i];
p->info=g.h[i];
p->next=adjl.adjs[g.a[i]-1].link;
p->adjvex=g.b[i];
p->next=adjl.adjs[g.a[i]-1].link;
adjl.adjs[g.a[i]-1].link=p;
p=(edgenode*)malloc(sizeof(edgenode));
if(!visit[i]){
visit[i]=1;
printf("%c ",adjl.adjs[i].data);
Q.push(i);
while(!Q.empty()){
j=Q.front();
Q.pop();
for( w=adjl.adjs[i].link;w;w=w->next)
status initstack(stackstru *s)
case 4:create_4(g);break;
default:printf("Error\n");
}
}
adjlist createlist (graph g ,adjlist adjl){
int i;
edgenode *p;
if(g.kind==1||g.kind==3)
g.arcs[i][j]=c;
for(k=0;k<g.arcnum;k++)
{ g.arcs[g.a[k]-1][g.b[k]-1]=1;
g.arcs[g.b[k]-1][g.a[k]-1]=1;
}
printf_adjmatrix(g);
stackstru *s;
linkqueue *q;
graph printf_adjmatrix(graph g){
int i,j;
printf("邻接矩阵:\n");
printf("vertex\t");
for (i=0;i<g.vexnum;i++) printf("%4c",g.vexs[i]);
g.arcs[g.a[k]-1][g.b[k]-1]=g.h[k];
printf_adjmatrix(g);
return g;
}
graph create_3(graph g){
int i,j,k,c=999;
for (i=0;i<g.vexnum;i++)