lrect.h

数据结构中栈算法的简单应用,通过程序模拟迷宫的生成和寻找出口的动态演示过程

typedef struct lPoint
{
   int x;
   int y;
}Point;

Point Start,End;
//Start.x=85,Start.y=85;
//End.x=850,End.y=850;

typedef struct lRect
{
	Point point1;
	Point point2;
	int isthrough;
	int isinway;
	int  di;
}Rect,*LRect;

void FillWhite(CBrush * pBrOld, CDC * pdc, Rect rect[10][10], int i,int j,int a,int b,int c,int d)
{
	if(i>=a&&i<=b&&j>=c&&j<=d)
	{
		CBrush hb(RGB(255,255,255));
		pBrOld = (CBrush*)pdc->SelectObject(&hb);
		pdc->Rectangle(rect[i][j].point1.x,rect[i][j].point1.y,rect[i][j].point2.x,rect[i][j].point2.y);
		rect[i][j].isthrough=1;
		rect[i][j].isinway=0;
		pdc->SelectObject(pBrOld);
	}
}