实验报告图遍历的演示

#include 
#include 
#define MAX 30
#define N 30
#define M 10
#define NULL 0
typedef struct ebox{
    int ivex,jvex;
    struct ebox *ilink,*jlink;
}ebox,*pebox;
typedef struct vexbox{
    char *data;
    pebox firstedge;
}vexbox,*pvexbox;
typedef struct amlgraph{
    vexbox adjmulist[MAX];
}amlgraph,pamlgraph;
typedef struct QNode{
    int data;
    struct QNode*next;
}QNode,*QueuePtr;
typedef struct{
    QueuePtr front;
    QueuePtr rear;
}LinkQueue;
LinkQueue InitQueue(){
    LinkQueue Q;
    Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
    Q.front->next=NULL;
    return Q;
}
int DeQueue(LinkQueue*Q){
    QueuePtr p;
    int e;
    p=Q->front->next;
    e=p->data;
    Q->front->next=p->next;
    if(Q->rear==p)
    Q->rear=Q->front;
    free(p);
    return e;
}
void EnQueue(LinkQueue*Q,int e){
    QueuePtr p;
    p=(QueuePtr)malloc(sizeof(QNode));
    p->data=e;
    p->next=NULL;
    Q->rear->next=p;
    Q->rear=p;
}
int QueueEmpty(LinkQueue Q){
    if(Q.front==Q.rear)     return     1;
    else return 0;
}
int visited[MAX]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
void initgraph(amlgraph &G,int n){
    for(int i=0;iivex=i;
        p1->jvex=j;
        p1->ilink=NULL;
        p1->jlink=NULL;
        p2=G.adjmulist[i].firstedge;
        if(p2==NULL)    G.adjmulist[i].firstedge=p1;
        else{
            mark=0;
            while(mark==0){
                if(p2->ivex==i && p2->ilink==NULL) mark=1;
                else if(p2->jvex==i && p2->jlink==NULL) mark=2;
                else if(p2->ivex==i) p2=p2->ilink;
                else p2=p2->jlink;
            }
            if(mark==1) p2->ilink=p1;
            else p2->jlink=p1;
        }
        p2=G.adjmulist[j].firstedge;
        if(p2==NULL)    G.adjmulist[j].firstedge=p1;
        else{
            mark=0;
            while(mark==0){
                if(p2->ivex==j && p2->ilink==NULL) mark=1;
                else if(p2->jvex==j && p2->jlink==NULL) mark=2;
                else if(p2->ivex==j) p2=p2->ilink;
                else p2=p2->jlink;
            }
            if(mark==1) p2->ilink=p1;
            else p2->jlink=p1;
        }
    }
}
void visit(amlgraph G,int v){
    printf("\n%s",G.adjmulist[v].data);
    visited[v]=1;
}
void DFS(amlgraph G,int v){
    pebox p;
    int mark;
    if(visited[v]==0) visit(G,v);
    else return;
    p=G.adjmulist[v].firstedge;
    if(p==NULL) return;
    else{
        mark=0;
        while(mark==0){
            if(p->ivex==v){
                if(visited[p->jvex]==0){
                    printf("\t\t\t<%d,%d>",p->ivex,p->jvex);
                    DFS(G,p->jvex);
                }
                if(p->ilink==NULL) mark=1;
                else p=p->ilink;
            }
            else{
                if(visited[p->ivex]==0){
                    printf("\t\t\t<%d,%d>",p->jvex,p->ivex);
                    DFS(G,p->ivex);
                }
                if(p->jlink==NULL) mark=1;
                else p=p->jlink;
            }
        }
    }
}
void BFS(amlgraph G,int v){
    LinkQueue Q;
    pebox p;
    int e;
    int mark;
    Q=InitQueue();
    if(visited[v]==0) visit(G,v);
    else return;
    EnQueue(&Q,v);
    while(QueueEmpty(Q)!=1){
        e=DeQueue(&Q);
        p=G.adjmulist[e].firstedge;
        if(p==NULL) return;
        mark=0;
        while(mark==0){
            if(p->ivex==e){
                if(visited[p->jvex]==0){
                    EnQueue(&Q,p->jvex);
                    printf("\t\t\t<%d,%d>",p->ivex,p->jvex);
                    visit(G,p->jvex);
                }
                if(p->ilink==NULL) mark=1;
                else p=p->ilink;
            }
            else{
                if(visited[p->ivex]==0){
                    EnQueue(&Q,p->ivex);
                    printf("\t\t\t<%d,%d>",p->jvex,p->ivex);
                    visit(G,p->ivex);
                }
                if(p->jlink==NULL) mark=1;
                else p=p->jlink;
            }
        }
    }
}
void clear(int v[MAX]){
    int i;
    for(i=0;i