统计细胞个数（广度优先搜索）

例：一矩形阵列由数字0到9组成，数字1到9代表细胞，细胞的定义为沿细胞数字上下左右还是相同数字则为同一细胞，如:阵列 
       0,1,0,0,0,0,0
       0,1,0,0,4,0,0
       0,1,1,0,4,0,0
       0,1,8,0,0,0,0
       0,0,8,5,5,5,0
       0,8,8,8,0,0,0
       0,0,8,0,0,0,1
有5个细胞，编写程序求给定矩形阵列的细胞个数。

#include <stdio.h>

int map[7][7] = {
	{0,1,0,0,0,0,0},
	{0,1,0,0,4,0,0},
	{0,1,1,0,4,0,0},
	{0,1,8,0,0,0,0},
	{0,0,8,5,5,5,0},
	{0,8,8,8,0,0,0},
	{0,0,8,0,0,0,1}
};
int x1[5] = {0,1,0,-1,0},y1[5] = {0,0,1,0,-1};//两个数组依次结合代表四个方向 

void searchCell(int x,int y,int num){
	int i;	
	for(i=1;i<=4;i++)//依次找到四个方向 
		if(x+x1[i]>0&&x+x1[i]<=6&&y+y1[i]>0&&y+y1[i]<=6/*排除越界的可能*/	
		&&map[x+x1[i]][y+y1[i]]==num/*确认是否是细胞数字*/){
			map[x+x1[i]][y+y1[i]]=0; //将找到细胞数字置为0防止重复
			searchCell(x+x1[i],y+y1[i],num);//搜索下一个点
		}
}
int countCell(){
	int sum = 0;
	int i,j,num;
	for(i=0;i<7;i++)
		for(j=0;j<7;j++)
			if(map[i][j]!=0){
				num = map[i][j];
				map[i][j] = 0;
				searchCell(i,j,num);
				sum++;
			}
	return sum;
}
int main(){
	int i,j;
	for(i=0;i<7;i++){
		for(j=0;j<7;j++)
			printf("%d ",map[i][j]);
		printf("\n");
	}
	printf("上图一共有%d个细胞。\n",countCell());
}