#include "myliantongyu.h"
#include <queue>
using namespace std;
void SetBox(int x, int y, mybox &box)
{
if(x < box.left)
box.left = x;
if(x > box.right)
box.right=x;
if(y<box.top)
box.top=y;
if(y>box.bottom)
box.bottom=y;
}
void liantongyu(CVisDMatrix data, mybox mb[], int &boxCount)
{
queue<Point> q;
boxCount = 0;
int h = data.NRows();
int w = data.NCols();
for( int i = 0; i < h; i++)
for( int j = 0; j < w; j++)
{
if( data[i][j] ==0 )
continue;
Point temp;
temp.x = j;
temp.y = i;
q.push(temp);
data[i][j] = 0;
mb[boxCount].left = j;
mb[boxCount].right = j;
mb[boxCount].top = i;
mb[boxCount].bottom = i;
while(!q.empty())
{
Point& p = q.front();
int t1 = p.x;
int t2 = p.y;
SetBox( p.x, p.y, mb[boxCount]);
if( data[p.y-1][p.x] != 0 ) //四连通
{
data[p.y-1][p.x] = 0;
temp.x = p.x;
temp.y = p.y - 1;
q.push(temp);
}
/*
if( data[ (p.y-1)*w+p.x-1] != 0)
{
data[ (p.y-1)*w+p.x -1] = 0;
temp.x = p.x - 1;
temp.y = p.y - 1;
q.push(temp);
};
if( data[ (p.y-1)*w+p.x+1] != 0)
{
data[ (p.y-1)*w+p.x+1] = 0;
temp.x = p.x+1;
temp.y = p.y - 1;
q.push(temp);
}*/
if( data[ p.y][p.x -1] != 0)
{
data[p.y][p.x-1] = 0;
temp.x = p.x-1;
temp.y = p.y;
q.push(temp);
}
if( data[ p.y ][p.x+1] != 0)
{
data[ p.y ][p.x+1] = 0;
temp.x = p.x+1;
temp.y = p.y;
q.push(temp);
}
if( data[p.y+1][p.x] != 0)
{
data[p.y+1][p.x] = 0;
temp.x = p.x;
temp.y = p.y + 1;
q.push(temp);
}
/* if( data[ (p.y+1)*w+p.x-1] != 0)
{
data[ (p.y+1)*w+p.x-1] = 0;
temp.x = p.x-1;
temp.y = p.y + 1;
q.push(temp);
}
if( data[ (p.y+1)*w+p.x+1] != 0)
{
data[ (p.y+1)*w+p.x+1] = 0;
temp.x = p.x+1;
temp.y = p.y + 1;
q.push(temp);
}*/
//mb[boxCount].count++;
q.pop();
}
boxCount++;
}
}
评论0