pta函数题6-1 Count Connected Components (20分)

6-1 Count Connected Components (20分)

Write a function to count the number of connected components in a given graph.

Format of functions:

int CountConnectedComponents( LGraph Graph );

where LGraph is defined as the following:

typedef struct AdjVNode *PtrToAdjVNode;
struct AdjVNode{
Vertex AdjV;
PtrToAdjVNode Next;
};
typedef struct Vnode{
PtrToAdjVNode FirstEdge;
} AdjList[MaxVertexNum];
typedef struct GNode *PtrToGNode;
struct GNode{
int Nv;
int Ne;
AdjList G;
};
typedef PtrToGNode LGraph;

The function CountConnectedComponents is supposed to return the number of connected components in the undirected Graph.

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>
typedef enum {false, true} bool;
#define MaxVertexNum 10 /* maximum number of vertices /
typedef int Vertex; / vertices are numbered from 0 to MaxVertexNum-1 */
typedef struct AdjVNode *PtrToAdjVNode;
struct AdjVNode{
Vertex AdjV;
PtrToAdjVNode Next;
};
typedef struct Vnode{
PtrToAdjVNode FirstEdge;
} AdjList[MaxVertexNum];
typedef struct GNode PtrToGNode;
struct GNode{
int Nv;
int Ne;
AdjList G;
};
typedef PtrToGNode LGraph;
LGraph ReadG(); / details omitted /
int CountConnectedComponents( LGraph Graph );
int main()
{
LGraph G = ReadG();
printf("%d\n", CountConnectedComponents(G));
return 0;
}
/ Your function will be put here */

Sample Input (for the graph shown in the figure):

8 6
0 7
0 1
2 0
4 1
2 4
3 5

Sample Output:

3

int CountConnectedComponents(LGraph Graph)
{
	int Nv = Graph->Nv;
	int count = 0, to;
	int i, start = 0, end = 0;
	int visit[MaxVertexNum] = { 0 };
	int queue[MaxVertexNum] = { 0 };	
	PtrToAdjVNode temp;
	for (i = 0; i < Nv; i++) {
		if (!visit[i]) {
			queue[start] = i;
			visit[i] = 1;
			while (start <= end) {
				to = queue[start++];
				temp = Graph->G[to].FirstEdge;
				while (temp!=NULL) {
					if (!visit[temp->AdjV]) {
						visit[temp->AdjV] = 1;
						queue[++end] = temp->AdjV;
					}
					temp = temp->Next;
				}
			}
			count++;
			end = start;
		}	
	}
	return count;
}