图的遍历

#define N 10
#define INFINITY 32768
#define True 1
#define False 0
#define Error -1
#define Ok 1
#include "stdlib.h"
#include "stdio.h"
typedef enum{DG,DN,UDG,UDN}GraphKind;
typedef char VertexData;
typedef struct ArcNode1
{
int adj;
} ArcNode1;
typedef struct
{
VertexData vexs[N];
ArcNode1 arcs[N][N];
int vexnum1,arcnum1;
GraphKind kind1;
}AdjMatrix;
typedef struct Node
{
int data;
struct Node *next;
}LinkQueueNode;
typedef struct
{
LinkQueueNode *front;
LinkQueueNode *rear;
}LinkQueue;
int InitQueue(LinkQueue *Q)
{
Q->front=(LinkQueueNode*)malloc(sizeof(LinkQueueNode));
if(Q->front!=NULL)
{
Q->rear=Q->front;
Q->front->next=NULL;
return(True);
}
else
return(False);
}
int EnterQueue(LinkQueue *Q,int x)
{
LinkQueueNode *NewNode;
NewNode=(LinkQueueNode*)malloc(sizeof(LinkQueueNode));
if(NewNode!=NULL)
{
NewNode->data=x;
NewNode->next=NULL;
Q->rear->next=NewNode;
Q->rear=NewNode;
return(True);
}
else
return(False);
}
int DeleteQueue(LinkQueue *Q,int *x)
{
LinkQueueNode *p;
if(Q->front==Q->rear)
return(False);
p=Q->front->next;
Q->front->next=p->next;
if(Q->rear==p)
Q->rear=Q->front;
*x=p->data;
free(p);
return(True);
}
int IsEmpty(LinkQueue *Q)
{
if(Q->front==Q->rear)
return(True);
else
return(False);
}
int visited[N];
int LocateVertex1(AdjMatrix *G1,VertexData v)
{
int k,j=Error;
for(k=0;k<G1->vexnum1;k++)
if(G1->vexs[k]==v)
{
j=k;
break;
}
return(j);
}
int CreateUDG1(AdjMatrix *G1)
{
int i,j,k;
VertexData v1,v2;
printf("\ninput G->vexnum,G->arcnum\n");
scanf("%d,%d",&(G1->vexnum1),&(G1->arcnum1));
getchar();
for(i=0;i<G1->vexnum1;i++)
for(j=0;j<G1->vexnum1;j++)
G1->arcs[i][j].adj=0;
printf("input G->vexs\n");
for(i=0;i<G1->vexnum1;i++)
{
scanf("%c",&(G1->vexs[i]));
}
getchar( );
printf("input G v1,v2\n");
for(k=0;k<G1->arcnum1;k++)
{
scanf("%c",&v1);
scanf("%c",&v2);
getchar( );
i=LocateVertex1(G1,v1);
j=LocateVertex1(G1,v2);
G1->arcs[i][j].adj=1;
G1->arcs[j][i].adj=1;
}
return(Ok);
}
/*........................*/
int showUDG1(AdjMatrix G1)
{
int i,j;
printf("\n Graph AdjMatrix:");
for(i=0;i<G1->vexnum1;i++)
for(j=0;j<G1->vexnum1;j++)
{ printf("%d",G1->arcs[i][j].adj);
printf("\n")
}
}
void Depth1(AdjMatrix g1,int vo)
{
}
void Breadth1(AdjMatrix g1,int vo)
{
int vi,vj;
LinkQueue Q;
InitQueue(&Q);
visited[vo]=True;
EnterQueue(&Q,vo);
while(!IsEmpty(&Q))
{
DeleteQueue(&Q,&vi);
printf("%c",g1.vexs[vi]);
for(vj=0;vj<g1.vexnum1;vj++)
if((!visited[vj])&&(g1.arcs[vi][vj].adj==1))
{
visited[vj]=True;
EnterQueue(&Q,vj);
}
}
}
void Traverse1(AdjMatrix g1)
{
int vi;
for(vi=0;vi<g1.vexnum1;vi++)
visited[vi]=False;
printf("\nThe order of G1 Depth\n");
for(vi=0;vi<g1.vexnum1;vi++)
{
if(!visited[vi])
{
Depth1(g1,vi);
printf("\n");
}
}
for(vi=0;vi<g1.vexnum1;vi++)
visited[vi]=False;
printf("\nThe order of G1 Breadth\n");
for(vi=0;vi<g1.vexnum1;vi++)
{
if(!visited[vi])
{
Breadth1(g1,vi);
printf("\n");
}
}
}
main( )
{
AdjMatrix g1;
CreateUDG1(&g1);
showUDG1(g1);
Traverse1(g1);
}。