纯c链队列 BFS DFS

#define INFINITY INT_MAX
#define ElementType int
#define VertexType char
#define EdgeType int
#define Max 50 //图的最大节点数
typedef struct QNode{
	ElementType data;
	struct QNode * next;
}QNode;
typedef struct{
	QNode* front,*rear;
	//int size;
}LinkQueue;
typedef struct MGraph{
	VertexType vertex[Max];
	EdgeType edge[Max][Max];
	int vexnum;

}MGraph;
void InitQueue(LinkQueue* q){
	q->front=q->rear=(QNode*)malloc(sizeof(QNode));
	q->front->next =NULL;
}
void EnQueue(LinkQueue *q,ElementType e){
	QNode* newNode=(QNode*)malloc(sizeof(QNode));
	newNode->data = e;
	newNode->next = NULL;
	q->rear->next = newNode;
	q->rear = newNode;
}
int  DeQueue(LinkQueue *q,ElementType * e){
	if(q->front == q->rear){
		return 0;
	}
	QNode* p = q->front->next;
	q->front->next = p->next;
	if(p==q->rear){
		q->rear =q->front;
	}
	*e = p->next->data;
	free(p);
	return 1;
}
int IsEmpty(LinkQueue q){
	if (q.front == q.rear){
		return 1;
	}else{
		return 0;
	}
}
void InitMGraph(MGraph* G){
	for (int i = 0;i<Max;i++)
		for(int j = 0;j<Max;j++){
			G->edge[i][j] =0;
	}
	G->vexnum =0;
}
//接着可以写图的添加边的操作
int visited[Max];
void BFSTraverse(MGraph G){
	for(int i =0;i<Max;i++){
		visited[i]=0;
	}
	for(int j = 0;j<G.vexnum;j++){
		BFS(G,j);
	}
}
void BFS(MGraph G,int v){
	printf("%c",G.vertex[v]);
	visited[v] =1;
	LinkQueue Q;
	InitQueue(&Q);
	EnQueue(&Q,v);
	int x;
	while(!IsEmpty(Q)){
		DeQueue(&Q,&x);
		for(int i =0;i<G.vexnum;i++){
			if(visited[i]==0&&G.edge[x][i]!=0){
				visited[i]=1;
				printf("%c",G.vertex[i]);
				EnQueue(&Q,i);
			}
		}
	}
}
void DFSTraverse(MGraph G){
	for(int i = 0;i<Max;i++){
		visited[i] = 0;
	}
	for(int j=0;j<G.vexnum;j++){
		DFS(G,j);
	}
}
void DFS(MGraph G,int v){
	if(visited[v] == 0){
		visited[v] = 1;
		printf("%c",G.vertex[v]);
	}
	for(int i = 0;i<G.vexnum;i++){
		if(G.edge[v][i]!=0&&visited[i] == 0&&G.edge[v][i]!=INFINITY){
			DFS(G,i);
		}
	}

}