DFS(Depth-First-Search)

#include<iostream>
using namespace std;
int **map,**record,start_x,start_y,target_x,target_y,row,col,minimum_step=9999;
void DFS(int x,int y,int step)
{
	int next_x,next_y,direction;
	if(x==target_x&&y==target_y)//boundary condition
	{
		if(minimum_step>step)
			minimum_step=step;
		return;
	}
	for(direction=0;direction<=3;direction++)//0:upward  1:leftward  2:downward  3:rightward
	{
		next_x=x;next_y=y;
		switch(direction)
		{
			case 0:next_y=y-1;break;
			case 1:next_x=x-1;break;
			case 2:next_y=y+1;break;
			case 3:next_x=x+1;break;
		}
		if(next_x<0||next_y<0||next_x>=row||next_y>=col)//Is the corrdinate over the boundary?
			continue;
		else if(record[next_x][next_y]==0&&map[next_x][next_y]==0)
		{
			record[next_x][next_y]=1;
			DFS(next_x,next_y,step+1);
			record[next_x][next_y]=0;
		}
	}
	return ;
}
void distribute_memory(int row,int col)
{
	map=new int*[row];
	record=new int*[row];
	for(int i=0;i<row;i++)
	{
		map[i]=new int[col]();
		record[i]=new int[col]();
	}
}
void delete_memory(int row)
{
	for(int i=0;i<row;i++)
	{
		delete[] map[i];
		delete[] record[i];
	}
	delete[] map;
	delete[] record;
}
int main()
{
	int i,j;
	cin>>row>>col;
	distribute_memory(row,col);
	for(i=0;i<row;i++)
		for(j=0;j<col;j++)
			cin>>map[i][j];
	cin>>start_x>>start_y>>target_x>>target_y;
	DFS(start_x,start_y,0);
	cout<<minimum_step<<endl;
	delete_memory(row);
	return 0;
}