图的深度优先遍历和广度优先遍历

图的深度与广度遍历

#define M 20   //预定义图的最大顶点数
typedef char DataType;   //顶点信息数据类型
typedef struct node {		//边表结点数
	int adjvex; //邻接点
	struct node* next;
}EdgeNode;
typedef struct vnode {
	DataType vertex; //顶点信息
	EdgeNode* FirstEdge;  //邻接链表头指针
}VertexNode;
typedef struct {  //邻接表类型
	VertexNode adjlist[M];//存放头节点都顺序表
	int n, e; //图的顶点数与边数
}LinkedGraph;

void creatlinke(LinkedGraph* g, char* filename, int c)
{
	int i, j, k;  //c = 0表示建立无向表，否则有向表
	EdgeNode* s;
	FILE* fp;
	fp = fopen(filename, "r");
	if (fp)
	{
		fscanf(fp, "%d%d", &g->n, &g->e);
		for (i = 0; i < g->n; i++)
		{
			fscanf(fp, "%ls", &g->adjlist[i].vertex);//读入顶点信息
			g->adjlist[i].FirstEdge = NULL;  //边表置空
		}
		for (k = 0; k < g->e; k++)  //循环e次建立边表
		{
			fscanf(fp, "%d%d", &i, &j);
			s = (EdgeNode*)malloc(sizeof(EdgeNode));
			s->adjvex = j;
			s->next = g->adjlist[i].FirstEdge;
			g->adjlist[i].FirstEdge = s;
			if (c == 0)
			{
				s = (EdgeNode*)malloc(sizeof(EdgeNode));
				s->adjvex = i;
				s->next = g->adjlist[j].FirstEdge;
				g->adjlist[j].FirstEdge = s;
			}

		}
		fclose(fp);
	}
	else
		g->n = 0;
}


//深度优先遍历
int visited[M];
void dfs(LinkedGraph g, int i)
{
	EdgeNode* p;
	cout << "vist vertex: " << g.adjlist[i].vertex << endl; //访问顶点i
	visited[i] = 1;
	p = g.adjlist[i].FirstEdge;
	while (p)
	{
		if (!visited[p->adjvex])
			dfs(g, p->adjvex);
		p = p->next;
	}
}

void DfsTraverse(LinkedGraph g)
{
	int i;
	for (i = 0; i < g.n; i++)
		visited[i] = 0;  //初始化标志数组
	for (i = 0; i < g.n; i++)
		if (!visited[i]) //vi未被访问过
			dfs(g, i);
}

//广度优先算法

void bfs(LinkedGraph g, int i)
{
	int j;
	EdgeNode* p;
	int queue[M], front, rear;  //FIFO队列
	front = rear = 0;
	cout << g.adjlist[i].vertex << endl; //访问源点v
	visited[i] = 1;
	queue[rear++] = i; //被访问结点进队
	while (rear > front)
	{
		j = queue[front++];
		p = g.adjlist[j].FirstEdge;
		while (p)
		{
			if (visited[p->adjvex] == 0)
			{
				cout << g.adjlist[p->adjvex].vertex << endl;
				queue[rear++] = p->adjvex;
				visited[p->adjvex] = 1;
			}
			p = p->next;
		}
	}
}
int BfsTraverse(LinkedGraph g)
{
	int i, count = 0;
	for (i = 0; i < g.n; i++)
		visited[i] = 0;
	for (i = 0; i < g.n; i++)
	{
		if (!visited[i])
		{
			printf("\n");
			count++;
			bfs(g, i);
		}
	}
	return count;
}