邻接图的深度广度优先遍历

邻接图的优点就是，现用现申请，空间存储很灵活，并且需要的空间也很小。我们在做复杂网络时，通常也是用这种方法。缺点是不适合并行化，因为cuda只支持连续地址空间的拷贝。

数据结构

主要包括，边节点和顶点节点

typedef struct edgeNode{
    int num;
    int weight;
    struct edgeNode * next;
}edgeNode;

typedef struct vertexNode{
    char data;
    edgeNode * firstNode;
}vertexNode,List[NUM];

typedef struct Graph{
    List list;
    int numver,numedges;
}Graph;

深度优先遍历

与矩阵图类似

void DFS(Graph *g,int i){
    edgeNode *p = (edgeNode *)malloc(sizeof(edgeNode));
    visited[i] = 1;
    printf("%c ",g->list[i].data);
    p = g->list[i].firstNode;
    while(p){
        if(!visited[p->num])
            DFS(g,p->num);
        p = p->next;
    }
}
void DFSTraverse(Graph *g){
    int i;
    for(i=0;i<g->numver;i++)
        visited[i] = 0;
    for(i=0;i<g->numver;i++)
        if(!visited[i])
            DFS(g,i);
}

广度优先遍历

void BFSTraverse(Graph *g){
    int i;
    edgeNode *p;
    Queue *q = (Queue *)malloc(sizeof(Queue));

    for(i=0;i<g->numver;i++)
        visited[i] = 0;
    initQueue(q,0);
    for(i=0;i<g->numver;i++){
        if(!visited[i]){
            visited[i] = 1;
            printf("%c ",g->list[i].data);
            inQueue(q,i);
            while(getLength(q)){
                int *tar = (int *)malloc(sizeof(int));
                outQueue(q,tar);
                p = g->list[*tar].firstNode;
                while(p){
                    if(!visited[p->num]){
                        visited[p->num] = 1;
                        printf("%c ",g->list[p->num].data);
                        inQueue(q,p->num);
                    }
                    p = p->next;
                }

            }
        }
    }

}

示例图

示例代码

#include <stdio.h>
#include <stdlib.h>
#define NUM 5
#define MAXSIZE NUM

typedef struct edgeNode{
    int num;
    int weight;
    struct edgeNode * next;
}edgeNode;

typedef struct vertexNode{
    char data;
    edgeNode * firstNode;
}vertexNode,List[NUM];

typedef struct Graph{
    List list;
    int numver,numedges;
}Graph;

typedef struct Queue{
    int data[NUM];
    int front;
    int rear;
}Queue;

void initQueue(Queue *q,int n);
void showQueue(Queue *q);
int getLength(Queue *q);
int inQueue(Queue *q,int num);
int outQueue(Queue *q,int *tar);

void createGraph(Graph *g);
void showGraph(Graph *g);
void add(Graph *g,int a,int b,int c);
void DFS(Graph *g,int i);
void DFSTraverse(Graph *g);
void BFSTraverse(Graph *g);

int visited[NUM];

int main()
{
    Graph * g = (Graph *)malloc(sizeof(Graph));
    createGraph(g);
    showGraph(g);
    printf("
");
    DFSTraverse(g);
    printf("
");
    BFSTraverse(g);
    return 0;
}
void add(Graph *g,int a,int b,int c){
    edgeNode *e;

    e = (edgeNode *)malloc(sizeof(edgeNode));
    e->next = g->list[a].firstNode;
    g->list[a].firstNode = e;
    e->num = b;
    e->weight = c;

    e = (edgeNode *)malloc(sizeof(edgeNode));
    e->next = g->list[b].firstNode;
    g->list[b].firstNode = e;
    e->num = a;
    e->weight = c;

    g->numedges++;


}

void createGraph(Graph *g){
    int i;
    for(i=0;i<NUM;i++){
        g->list[i].data = 65+i;
        g->list[i].firstNode = NULL;
    }
    g->numver = NUM;
    g->numedges = 0;
    //添加顶点0的边
    add(g,0,1,0);
    add(g,0,2,0);
    add(g,0,3,0);
    add(g,0,4,0);

    add(g,1,3,0);
    add(g,1,4,0);

    add(g,2,4,0);

    add(g,3,4,0);
}
void showGraph(Graph *g){
    int i;
    for(i=0;i<g->numver;i++){
        printf("g[%d] ",i);
        edgeNode *p = (edgeNode *)malloc(sizeof(edgeNode));
        p = g->list[i].firstNode;
        while(p){
            printf("->%d(%d)",p->num,p->weight);
            p = p->next;
        }
        printf("->null
");
    }
}

void DFS(Graph *g,int i){
    edgeNode *p = (edgeNode *)malloc(sizeof(edgeNode));
    visited[i] = 1;
    printf("%c ",g->list[i].data);
    p = g->list[i].firstNode;
    while(p){
        if(!visited[p->num])
            DFS(g,p->num);
        p = p->next;
    }
}
void DFSTraverse(Graph *g){
    int i;
    for(i=0;i<g->numver;i++)
        visited[i] = 0;
    for(i=0;i<g->numver;i++)
        if(!visited[i])
            DFS(g,i);
}
void BFSTraverse(Graph *g){
    int i;
    edgeNode *p;
    Queue *q = (Queue *)malloc(sizeof(Queue));

    for(i=0;i<g->numver;i++)
        visited[i] = 0;
    initQueue(q,0);
    for(i=0;i<g->numver;i++){
        if(!visited[i]){
            visited[i] = 1;
            printf("%c ",g->list[i].data);
            inQueue(q,i);
            while(getLength(q)){
                int *tar = (int *)malloc(sizeof(int));
                outQueue(q,tar);
                p = g->list[*tar].firstNode;
                while(p){
                    if(!visited[p->num]){
                        visited[p->num] = 1;
                        printf("%c ",g->list[p->num].data);
                        inQueue(q,p->num);
                    }
                    p = p->next;
                }

            }
        }
    }

}

void initQueue(Queue *q,int n){
    int i;
    q->front=0;
    q->rear =0;
    for(i=0;i<n;i++){
        q->data[q->rear]=2*i+1;
        q->rear++;
    }
}
void showQueue(Queue *q){
    int i;
    int len=getLength(q);
    printf("front-");
    for(i=0;i<len;i++){
        if(q->front+i<MAXSIZE)
            printf("%d-",q->data[q->front+i]);
        else
            printf("%d-",q->data[q->front+i-MAXSIZE]);
    }
    printf("rear
");
}
int getLength(Queue *q){
    return (q->rear-q->front+MAXSIZE)%MAXSIZE;
}
int inQueue(Queue *q,int num){
    if((q->rear+1)%MAXSIZE == q->front)
        return 0;
    q->data[q->rear] = num;
    q->rear = (q->rear+1)%MAXSIZE;
    return 1;
}
int outQueue(Queue *q,int *tar){
    if(q->front == q->rear)
        return 0;
    *tar = q->data[q->front];
    q->front = (q->front+1)%MAXSIZE;
    return 1;
}

运行结果