深度搜索应用之黑白图像(非递归)

#include <iostream>
#include <memory.h>
#include <stack>
using namespace std;
const int MAXN=8;

typedef struct
{
int x;
int y;
} node;

stack<node> stack_temp;
node node_temp;
void push_value(int x,int y)
{
node_temp.x=x;
node_temp.y=y;
stack_temp.push(node_temp);
}

int mat[MAXN][MAXN]= {0,0,0,0,0,0,0,0,
0,1,0,0,1,0,0,0,
0,0,0,1,0,1,0,0,
0,0,0,0,0,0,0,0,
0,1,1,0,0,0,0,0,
0,1,1,1,0,0,0,0,
0,0,1,0,1,0,0,0,
0,0,0,0,0,0,0,0
},vist[MAXN][MAXN]= {0};

void dfs(int x,int y)
{
push_value(x,y);
vist[x][y]=1;
bool flag_break=false;
bool flag_for_over=false;
while(!stack_temp.empty())
{
int temp_x=stack_temp.top().x,temp_y=stack_temp.top().y;

/**< 对周围的8个结点进行遍历 */
for(int i=temp_x-1,last_x = temp_x+1; i<=last_x; ++i)
{
for(int j=temp_y-1,last_y = temp_y+1; j<=last_y; ++j)
{
if(mat[i][j]&&!vist[i][j])
{
cout<<"("<<i<<","<<j<<")"<<endl;
vist[i][j]=1;
push_value(i,j);
flag_break=true;
break;
}
}
/**< 用于标志一个有效结点，方便对下周围的结点进行遍历 */
if(flag_break)
{
flag_break=false;
break;
}

/**< 用于标志一个for循环是否结束,用于判断出栈的标志 */
if(i>=last_x)
{
flag_for_over=true;
break;
}
}

/**< 若一个循环结束，则踢出一个结点 */
if(flag_for_over)
{
stack_temp.pop();
flag_for_over=false;
}
}
return ;
}

int main()
{
int count_=0;
memset(vist,0,sizeof(vist));
for(int i=1; i<=6; ++i)
{
for(int j=1; j<=6; ++j)
{
if(mat[i][j] && !vist[i][j])
{
++count_;
dfs(i,j);
}
}
}
cout<<count_<<endl;
return 0;
}