cell.h

迷宫问题

//The class Cell represents one square in the map

#if !defined CELL_H
#define CELL_H

class Cell
{
	public:
		Cell (int i=0, int j=0, int k=-1);		//i,j为此格的列和行坐标，k为前驱格子在队列数组中的序号
		bool operator == (const Cell& c) const;
		bool operator != (const Cell& c) const;
		Cell operator = (const Cell& c);
	private:
		int x, y, pre;			//x,y为此格的列和行坐标, pre为前驱格子在队列数组中的序号
		friend class Building;
		friend class Stack_Building;
		friend class Queue_Building;
		friend class Opt_Building;
};

#endif