Introduction - If you have any usage issues, please Google them yourself
Optionally generate an M* N matrix, and to find one or more shortest path first algorithm according to the depth and breadth-first algorithm, through a graphical interface markup output coordinates of individual nodes. Requirements maze is random and is connected.