苗火 Nicholas

[Data structures]Graph travers (DFS and BFS)

2019-7-23 萧 写技术

#include <stdio.h>
#include <stdlib.h>

#define MAX 20
#define INFINIT	65535

typedef struct _ArcCell{
	int adj; // Weight or flag about connection
	int *info; // Other information
}ArcCell;

typedef char VertexType;

typedef enum{
	DG,
	DN,
	UDG,
	UDN
}GraphKind;

typedef struct _MGraph{
	VertexType vexs[MAX];
	ArcCell arcs[MAX][MAX];
	int vexnum;
	int arcnum;
	GraphKind kind;
}MGraph;

int visited[MAX];

int LocateVex(MGraph *G, VertexType v)
{
	int i=0;
	while(i<G->vexnum && G->vexs[i] != v){
		i++;
	}
	if(i<G->vexnum){
		return i;
	}else{
		return -1;
	}
}

int CreateUDG(MGraph *G)
{
	int i,j,k;
	char v1,v2;

	scanf(" %d %d", &G->vexnum, &G->arcnum);	
	for(i=0; i<G->vexnum; i++){
		scanf(" %c", &G->vexs[i] );
	}
	for(i=0; i<G->vexnum; i++){
		for(j=0; j<G->vexnum; j++){
			G->arcs[i][j].adj = INFINIT;
		}
	}
	for(k=0; k<G->arcnum; k++){
		scanf(" %c %c", &v1, &v2);
		i=LocateVex(G, v1);
		j=LocateVex(G, v2);	
		G->arcs[i][j].adj = 1;
		G->arcs[j][i].adj = 1;	
	}
	return 1;
}

int FirstAdjvex(MGraph *G, int v)
{
	int i=0;
	while(i<G->vexnum && G->arcs[v][i].adj == INFINIT){
		i++;
	}	
	if(i<G->vexnum){
		return i;
	}else{
		return -1;
	}
}

int NextAdjvex(MGraph *G, int v, int w)
{
	int i=w+1;
	while(i<G->vexnum && G->arcs[v][i].adj == INFINIT){
		i++;
	}
	if(i<G->vexnum){
		return i;
	}else{
		return -1;
	}

}

void DFS(MGraph *G, int v)
{
	int w;
	printf(" %c->", G->vexs[v]);
	visited[v] = 1;
	for(w = FirstAdjvex(G, v); w>=0; w = NextAdjvex(G, v, w) ){
		if(!visited[w]){
			DFS(G, w);
		}
	}
}	

void DFSTravers(MGraph *G)
{
	int i;
	for(i=0; i<G->vexnum; i++){
		visited[i] = 0;
	}
	for(i=0; i<G->vexnum; i++){
		if(!visited[i]){
			DFS(G, i);
		}
	}
}

void BFSTravers(MGraph *G)
{
	int queue[MAX];
	int head = 0;
	int tail = 0;

	int v;
	int w;
	int u;
	int i;
	for(i=0; i<G->vexnum; i++){
		visited[i] = 0;
	}

	for(v=0; v<G->vexnum; v++){
		if(!visited[v]){
			printf(" %c->", G->vexs[v]);
			visited[v] = 1;

			queue[tail++] = v;

			while(tail != head){
				u = queue[head++];

				for(w = FirstAdjvex(G, u); w >= 0; w = NextAdjvex(G, u, w) ){
					if(!visited[w]){
						printf(" %c->", G->vexs[w]);
						visited[w] = 1;
						queue[tail++] = w;
					}
				}
			}
		}	
	}
}

void main()
{
	MGraph G;	

	printf("log.anycle.com\n\n");
	printf("Create graph:\n");
	CreateUDG(&G);
	printf("\n");

	printf("Depth first search travers:\n");
	DFSTravers(&G);
	printf("\n");

	printf("Broadth first search travers:\n");
	BFSTravers(&G);
	printf("\n");
}

标签: Data Structures data_structures