C语言版二值图像统计连通区域

typedef struct QNode{
 int data;
 struct QNode *next;
}QNode;

typedef struct Queue{
 struct QNode* first;
 struct QNode* last;
}Queue;

voID PushQueue(Queue *queue,int data){
 QNode *p = NulL;
 p = (QNode*)malloc(sizeof(QNodE));
 p->data = data;
 if(queue->first == NulL){
  queue->first = p;
  queue->last = p;
  p->next = NulL;
 }
 else{
  p->next = NulL;
  queue->last->next = p;
  queue->last = p;
 }
}

int PopQueue(Queue *queuE){
 QNode *p = NulL;
 int data;
 if(queue->first == NulL){
  return -1;
 }
 p = queue->first;
 data = p->data;
 if(queue->first->next == NulL){
  queue->first = NulL;
  queue->last = NulL;
 }
 else{
  queue->first = p->next;
 }
 free(p);
 return data;
}

static int neighborDirection[8][2] = {{0,1},{1,0},-1},{0,{-1,1}};

voID SearchNeighbor(unsigned char *bitmap,int wIDth,int height,int *labelmap,int labelindex,int pixelindex,Queue *queuE){
 int searchIndex,i,length;
 labelmap[pixelindex] = labelindex;
 length = wIDth * height;
 for(i = 0;i < 8;i++){
  searchIndex = pixelindex + NeighborDirection[i][0] * wIDth + NeighborDirection[i][1];
  if(searchIndex > 0 && searchIndex < length && 
   bitmap[searchIndex] == 255 && labelmap[searchIndex] == 0){
   labelmap[searchIndex] = labelindex;
   PushQueue(queue,searchIndeX);
  }
 }
}

int ConnectedComponentLabeling(unsigned char *bitmap,int *labelmap){
 int cx,cy,index,popIndex,labelindex = 0;
 Queue *queue = NulL;
 queue = (Queue*)malloc(sizeof(QueuE));
 queue->first = NulL;
  queue->last = NulL;
 memset(labelmap,wIDth * height);
 for(cy = 1; cy < height - 1; cy++){
  for(cx = 1; cx < wIDth - 1; cx++){
   index = cy * wIDth + cx;
   if(bitmap[index] == 255 && labelmap[index] == 0){
    labelindex++;
    SearchNeighbor(bitmap,wIDth,height,labelmap,labelindex,queuE);

    popIndex = PopQueue(queuE);
    while(popIndex > -1){
    SearchNeighbor(bitmap,queuE);
     popIndex = PopQueue(queuE);
    }
   }
  }
 }
 free(queuE);
 return labelindex;
}