?? wave.cpp
字號(hào):
// Wave.cpp: implementation of the CWave class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "SearchPath.h"
#include "Wave.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
extern map[Height][Width];
CWave::CWave()
{
for(int i=0;i<Height;i++)
{
for(int j=0;j<Width;j++)
{
m_pNode[i][j] = &m_node[i][j];
m_node[i][j].close = 0;
m_node[i][j].next = NULL;
m_node[i][j].value = -1;//一開始節(jié)點(diǎn)初始值為-1
m_node[i][j].x = j;
m_node[i][j].y = i;
if(map[i][j]==0)
{
startX=j;
startY=i;
}
else if(map[i][j]==-3)
{
targetX=j;
targetY=i;
}
}
}
}
CWave::~CWave()
{
}
int CWave::searchThePath()
{
wa_node *head = m_pNode[startY][startX];
head->value = 0;
head->close = 1;
while(head!=NULL)
{
wa_node *s,*newHead = NULL,*newS,*newP;
s = head;
while(s!=NULL)
{
int i=s->y,j=s->x;
if((map[i+1][j]!=-1)&&(m_node[i+1][j].close==0))//如果不在close列表中
{
int ii = i+1;
if(map[ii][j]==-3)
{
m_node[ii][j].value = m_node[i][j].value + 1;
return 1;
}
m_node[ii][j].value = m_node[i][j].value + 1;
m_node[ii][j].close = 1;
newS = m_pNode[ii][j];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
if((map[i-1][j]!=-1)&&(m_node[i-1][j].close==0))//如果不在close列表中
{
int ii = i-1;
if(map[ii][j]==-3)
{
m_node[ii][j].value = m_node[i][j].value + 1;
return 1;
}
m_node[ii][j].value = m_node[i][j].value + 1;
m_node[ii][j].close = 1;
newS = m_pNode[ii][j];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
if((map[i][j+1]!=-1)&&(m_node[i][j+1].close==0))//如果不在close列表中
{
int jj = j+1;
if(map[i][jj]==-3)
{
m_node[i][jj].value = m_node[i][j].value + 1;
return 1;
}
m_node[i][jj].value = m_node[i][j].value + 1;
m_node[i][jj].close = 1;
newS = m_pNode[i][jj];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
if((map[i][j-1]!=-1)&&(m_node[i][j-1].close==0))//如果不在close列表中
{
int jj = j-1;
if(map[i][jj]==-3)
{
m_node[i][jj].value = m_node[i][j].value + 1;
return 1;
}
m_node[i][jj].value = m_node[i][j].value + 1;
m_node[i][jj].close = 1;
newS = m_pNode[i][jj];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
s = s->next;
}
head = newHead;
}
return 0;
}
void CWave::prepareForStepByStep()
{
m_head = m_pNode[startY][startX];
m_head->value = 0;
m_head->close = 1;
}
int CWave::searchThePathStepByStep()
{
if(m_head!=NULL)
{
wa_node *s,*newHead = NULL,*newS,*newP;
s = m_head;
while(s!=NULL)
{
int i=s->y,j=s->x;
if((map[i+1][j]!=-1)&&(m_node[i+1][j].close==0))//如果不在close列表中
{
int ii = i+1;
if(map[ii][j]==-3)
{
m_node[ii][j].value = m_node[i][j].value + 1;
return 1;
}
m_node[ii][j].value = m_node[i][j].value + 1;
m_node[ii][j].close = 1;
newS = m_pNode[ii][j];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
if((map[i-1][j]!=-1)&&(m_node[i-1][j].close==0))//如果不在close列表中
{
int ii = i-1;
if(map[ii][j]==-3)
{
m_node[ii][j].value = m_node[i][j].value + 1;
return 1;
}
m_node[ii][j].value = m_node[i][j].value + 1;
m_node[ii][j].close = 1;
newS = m_pNode[ii][j];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
if((map[i][j+1]!=-1)&&(m_node[i][j+1].close==0))//如果不在close列表中
{
int jj = j+1;
if(map[i][jj]==-3)
{
m_node[i][jj].value = m_node[i][j].value + 1;
return 1;
}
m_node[i][jj].value = m_node[i][j].value + 1;
m_node[i][jj].close = 1;
newS = m_pNode[i][jj];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
if((map[i][j-1]!=-1)&&(m_node[i][j-1].close==0))//如果不在close列表中
{
int jj = j-1;
if(map[i][jj]==-3)
{
m_node[i][jj].value = m_node[i][j].value + 1;
return 1;
}
m_node[i][jj].value = m_node[i][j].value + 1;
m_node[i][jj].close = 1;
newS = m_pNode[i][jj];
newS->next=NULL;
if(newHead==NULL)
{
newHead = newS;
newP = newS;
}
else
{
newP->next = newS;
newP = newS;
}
}
s = s->next;
}
m_head = newHead;
return 2;//表示尋徑過程沒有結(jié)束!
}
return 0;
}
void CWave::showThePath(CDC *pDC , int showMode)
{
CBitmap bm1,bm2,bm3,bm5,bm6, *pbm;
BITMAP bmMetric1,bmMetric2;
bm1.LoadBitmap(IDB_BITMAP7);
bm2.LoadBitmap(IDB_BITMAP8);
bm3.LoadBitmap(IDB_BITMAP11);
bm5.LoadBitmap(IDB_BITMAP12);//起點(diǎn)
bm6.LoadBitmap(IDB_BITMAP13);//終點(diǎn)
bm1.GetBitmap(&bmMetric1);
bm2.GetBitmap(&bmMetric2);
CDC memDC;
memDC.CreateCompatibleDC(pDC);
pbm = memDC.SelectObject(&bm1);
if(showMode == 1)
{
//描繪搜索過的點(diǎn)
for(int i=0;i<Height;i++)
{
for(int j=0;j<Width;j++)
{
if(m_node[i][j].value>=1)
{
memDC.SelectObject(&bm3);
pDC->BitBlt(j*bmMetric1.bmHeight, i*bmMetric1.bmWidth,bmMetric1.bmWidth,bmMetric1.bmHeight,&memDC,0,0,SRCCOPY);
//char buf[4];
//sprintf(buf,"%d", m_map[i][j]);
//pDC->TextOut(j*bmMetric2.bmWidth+5,i*bmMetric2.bmHeight+5,buf);
}
}
}
//結(jié)束描繪搜索過的點(diǎn)
}
//用漸變顏色顯示搜索過的點(diǎn)
if(showMode == 2)
{
const int colorBeg = 70;
int totalStep = (255 - colorBeg) * 5;
double max = m_node[targetY][targetX].value;
int R, G, B, temp;
for(int i=0;i<Height;i++)
{
for(int j=0;j<Width;j++)
{
if(m_node[i][j].value != -1)
{
int curStep = (int)(m_node[i][j].value/max * totalStep);
if(curStep > (temp = (255 - colorBeg) * 4))
{
R = curStep - temp + colorBeg;
G = colorBeg;
B = 255;
}
else if(curStep > (temp = (255 - colorBeg) * 3))
{
R = colorBeg;
G = 255 - (curStep - temp);
B = 255;
}
else if(curStep > (temp = (255 - colorBeg) * 2))
{
R = colorBeg;
G = 255;
B = curStep - temp + colorBeg;
}
else if(curStep > (temp = (255 - colorBeg)))
{
R = 255 - (curStep - temp);
G = 255;
B = colorBeg;
}
else
{
R = 255;
G = curStep + colorBeg;
B = colorBeg;
}
CRect tempRect(j*bmMetric2.bmWidth,i*bmMetric2.bmHeight,(j+1)*bmMetric2.bmWidth,(i+1)*bmMetric2.bmHeight);
CBrush brushBg;
brushBg.CreateSolidBrush(RGB(R,G,B));
pDC->FillRect(&tempRect,&brushBg);
}
}
}
}
//結(jié)束描繪漸變色
//用漸變顏色一步一步顯示搜索過的點(diǎn)
if(showMode == 3)
{
double max = 0;
for(int i=0;i<Height;i++)
{
for(int j=0;j<Width;j++)
{
if(m_node[i][j].value > max)
{
max = m_node[i][j].value;
}
}
}
//已經(jīng)找到當(dāng)前的最大步數(shù)
const int colorBeg = 70;
int totalStep = (255 - colorBeg) * 5;
//double max = m_node[targetY][targetX].value;
int R, G, B, temp;
for(i=0;i<Height;i++)
{
for(int j=0;j<Width;j++)
{
if(m_node[i][j].value != -1)
{
int curStep = (int)(m_node[i][j].value/max * totalStep);
if(curStep > (temp = (255 - colorBeg) * 4))
{
R = curStep - temp + colorBeg;
G = colorBeg;
B = 255;
}
else if(curStep > (temp = (255 - colorBeg) * 3))
{
R = colorBeg;
G = 255 - (curStep - temp);
B = 255;
}
else if(curStep > (temp = (255 - colorBeg) * 2))
{
R = colorBeg;
G = 255;
B = curStep - temp + colorBeg;
}
else if(curStep > (temp = (255 - colorBeg)))
{
R = 255 - (curStep - temp);
G = 255;
B = colorBeg;
}
else
{
R = 255;
G = curStep + colorBeg;
B = colorBeg;
}
CRect tempRect(j*bmMetric2.bmWidth,i*bmMetric2.bmHeight,(j+1)*bmMetric2.bmWidth,(i+1)*bmMetric2.bmHeight);
CBrush brushBg;
brushBg.CreateSolidBrush(RGB(R,G,B));
pDC->FillRect(&tempRect,&brushBg);
}
}
}
}
//如果是演示程序就不用顯示路徑
if(showMode != 3)
{
//描繪最短路徑
CPen pen,*p_pen;
pen.CreatePen(PS_SOLID,2,RGB(0,0,255));
p_pen = pDC->SelectObject(&pen);
pDC->MoveTo(targetX * bmMetric2.bmWidth+bmMetric2.bmWidth/2 , targetY * bmMetric2.bmHeight+bmMetric2.bmHeight/2);
int i=targetY;
int j=targetX;
int min=20000;
int k=i,l=j;
if((m_node[i+1][j].value>=0)&&(m_node[i+1][j].value<min))
{
min=m_node[i+1][j].value;
k=i+1;
l=j;
}
if((m_node[i-1][j].value>=0)&&(m_node[i-1][j].value<min))
{
min=m_node[i-1][j].value;
k=i-1;
l=j;
}
if((m_node[i][j+1].value>=0)&&(m_node[i][j+1].value<min))
{
min=m_node[i][j+1].value;
k=i;
l=j+1;
}
if((m_node[i][j-1].value>=0)&&(m_node[i][j-1].value<min))
{
min=m_node[i][j-1].value;
k=i;
l=j-1;
}
i=k;
j=l;
while(m_node[i][j].value!=0)
{
if(m_node[i+1][j].value == min-1)
{
i = i+1;
}
else if(m_node[i-1][j].value == min-1)
{
i = i-1;
}
else if(m_node[i][j+1].value == min-1)
{
j = j+1;
}
else if(m_node[i][j-1].value == min-1)
{
j = j-1;
}
min--;
pDC->LineTo(j * bmMetric2.bmWidth+bmMetric2.bmWidth/2 , i * bmMetric2.bmHeight+bmMetric2.bmHeight/2);
}
pDC->LineTo(startX * bmMetric2.bmWidth+bmMetric2.bmWidth/2 , startY * bmMetric2.bmHeight+bmMetric2.bmHeight/2);
pDC->SelectObject(p_pen);
pen.DeleteObject();
//結(jié)束描繪最短路徑
}
/*
//顯示搜索過的點(diǎn)離起點(diǎn)的值
CFont *poldfont,*newfont=new CFont;
TEXTMETRIC tm;
newfont->CreateFont(10,0,0,0,FW_NORMAL,0,0,0,GB2312_CHARSET,OUT_DEFAULT_PRECIS,CLIP_DEFAULT_PRECIS,DEFAULT_QUALITY,DEFAULT_PITCH,"宋體");
poldfont=pDC->SelectObject(newfont);
pDC->GetTextMetrics(&tm);
for(i=0;i<Height;i++)
{
for(int j=0;j<Width;j++)
{
if(m_map[i][j]>=1)
{
char buf[4];
sprintf(buf,"%d", m_map[i][j]);
pDC->TextOut(j*bmMetric2.bmWidth+5,i*bmMetric2.bmHeight+5,buf);
}
}
}
pDC->SelectObject(poldfont);
newfont->DeleteObject();
*/
//描繪地圖
for(int i = 0; i < Height; i ++)
{
for(int j = 0; j < Width; j ++)
{
if(map[i][j]==-1)
{
memDC.SelectObject(&bm1);
pDC->BitBlt(j*bmMetric1.bmHeight, i*bmMetric1.bmWidth,bmMetric1.bmWidth,bmMetric1.bmHeight,&memDC,0,0,SRCCOPY);
}
else if(map[i][j]==0)
{
memDC.SelectObject(&bm5);
pDC->BitBlt(j*bmMetric2.bmHeight, i*bmMetric2.bmWidth,bmMetric2.bmWidth,bmMetric2.bmHeight,&memDC,0,0,SRCCOPY);
}
else if(map[i][j]==-3)
{
memDC.SelectObject(&bm6);
pDC->BitBlt(j*bmMetric2.bmHeight, i*bmMetric2.bmWidth,bmMetric2.bmWidth,bmMetric2.bmHeight,&memDC,0,0,SRCCOPY);
}
}
}
memDC.SelectObject(pbm);
bm1.DeleteObject();
bm2.DeleteObject();
memDC.DeleteDC();
}
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -