Recursion to Solve a 2D String Array Maze

gistfile1.txt

class Coord
{
    public:
    Coord(int rr, int cc) : m_r(rr), m_c(cc) {}
    int r() const { return m_r; }
    int c() const { return m_c; }
    private:
    int m_r;
	int m_c;
};

bool pathExists(string maze[], int nRows, int nCols, int sr, int sc, int er, int ec)
	// Return true if there is a path from (sr,sc) to (er,ec)
	// through the maze; return false otherwise
{
	if (sr < 0 || sc < 0 || er < 0 || ec < 0 
		 || sr > nRows || sc > nCols || er > nRows
		 || ec > nCols)
		 return false;

	if (sr == er && sc == ec)
		 return true;

	  // drop a bread crumb
	 maze[sr][sc] = '#';

	  // north
	if (maze[sr-1][sc] == '.' && pathExists(maze,nRows,nCols,sr-1,sc,er,ec) == true)
		return true;

	  // east
	if (maze[sr][sc+1] == '.' && pathExists(maze,nRows,nCols,sr,sc+1,er,ec) == true)
		return true;

	  // south
	if (maze[sr+1][sc] == '.' && pathExists(maze,nRows,nCols,sr+1,sc,er,ec) == true)
		return true;

	  // west
	if (maze[sr][sc-1] == '.' && pathExists(maze,nRows,nCols,sr,sc-1,er,ec) == true)
		return true;

	return false;
}