图的深度遍历DFS与广度遍历BFS算法 c语言实现

main.c

#include "DBFS.h"
int main()
{
    Graph G[N][N];
    Visit visit[N];
    InitGraph(G,visit);
    printf("DFS:n");
    DFS(G,visit,1);
    printf("BFS:n");
    InitGraph(G,visit);
    BFS(G,visit,1);
}

DBFS.c

#include"DBFS.h"
#include"Queue.h"
void InitGraph(Graph G[][N],Visit *visit)
{
    int i,j;
    int temp[N][N]=
    {
        {0,1,1,0,0,0,0,0},
        {1,0,0,1,1,0,0,0},
        {1,0,0,0,0,1,1,0},
        {0,1,0,0,0,0,0,1},
        {0,1,0,0,0,0,0,1},
        {0,0,1,0,0,0,1,0},
        {0,0,1,0,0,1,0,0},
        {0,0,0,1,1,0,0,0}
    };
    for(i=0;i 
DBFS.h
 
#define N 8
#include 
typedef int Graph;
typedef int Visit;
void InitGraph(Graph G[][N],Visit *visit);
int FirstNode(Graph G[][N],int v);
int NextNode(Graph G[][N],int v,int node);
void DFS(Graph G[][N],Visit *visit,int v);
void BFS(Graph G[][N],Visit *visit,int v);
 
Queue.c
 
#include"Queue.h"
void InitQueue(Queue *Q)
{
    Q->base=(int *)malloc(MAXQSIZE *sizeof(int));
    Q->front=Q->rear=0;
}
void QuenuePush(Queue *Q,int q)
{
    Q->base[Q->rear]=q;
    Q->rear=(Q->rear+1)%MAXQSIZE;
}
void QueuePop(Queue *Q,int *q)
{
    *q=Q->base[Q->front];
    Q->front=(Q->front+1)%MAXQSIZE;
}
int QueueEmpty(Queue *Q)//1的时候是空
{
    if((Q->rear-Q->front+MAXQSIZE)%MAXQSIZE==0)
    return 1;
    else
    return 0;
}
 
Queue.h
 
#define MAXQSIZE 20
#include
typedef struct Queue
{
    int *base;
    int front;
    int rear;
}Queue;
void InitQueue(Queue *Q);
void QuenuePush(Queue *Q,int q);
void QueuePop(Queue *Q,int *q);
int QueueEmpty(Queue *Q);