Implement a path-finding algorithm in C++ that finds and returns a shortest path between two points in a 2-dimensional grid.
Note that this specific problem can only be solved using C++.
Your algorithm should provide an implementation of the following function declaration.
int FindPath(const int nStartX, const int nStartY, const int nTargetX, const int nTargetY, const unsigned char* pMap, const int nMapWidth, const int nMapHeight, int* pOutBuffer, const int nOutBufferSize);
The meaning of the parameters are as follows.
nStartX and nStartY are the $0$-based coordinates of the start position.
nTargetX and nTargetY are the $0$-based coordinates of the target position.
pMap describes a grid of width $\texttt{nMapWidth}$ and height $\texttt{nMapHeight}$. The grid is given in row-major order, each row is given in order of increasing $x$-coordinate, and the rows are given in order of increasing $y$-coordinate. Traversable locations of the grid are indicated by 1, and impassable locations are indicated by 0. Locations are considered to be adjacent horizontally and vertically but not diagonally.
pOutBuffer is where you should store the positions visited in the found path, excluding the starting position but including the final position. Entries in pOutBuffer are indices into pMap. If there is more than one shortest path from Start to Target, any one of them will be accepted.
nOutBufferSize is the maximum number of entries that can be written to pOutBuffer.
The function must return the length of the shortest path between Start and Target, or $-1$ if no such path exists.
If the shortest path is longer than nOutBufferSize, the calling function might either give up or choose to call FindPath again with a larger output buffer.
You may safely assume that:
$1 \le \texttt{nMapWidth}, \texttt{nMapHeight}$,
$0 \le \texttt{nStartX}, \texttt{nTargetX} < \texttt{nMapWidth}$,
$0 \le \texttt{nStartY}, \texttt{nTargetY} < \texttt{nMapHeight}$,
Both Start and Target are empty locations,
$\texttt{nOutBufferSize} \ge 0$.
unsigned char pMap[] = {1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1}; int pOutBuffer[12]; FindPath(0, 0, 1, 2, pMap, 4, 3, pOutBuffer, 12);
For this input FindPath must return $3$, and the first three positions of pOutBuffer must be populated with {1, 5, 9}.
unsigned char pMap[] = {0, 0, 1, 0, 1, 1, 1, 0, 1}; int pOutBuffer[7]; FindPath(2, 0, 0, 2, pMap, 3, 3, pOutBuffer, 7);
For this input FindPath must return $-1$.
Consider performance, memory usage and assume that your code may be called from a multi-threaded environment.