用VC++实现SA算法，求解48个城市的最短路径问题-With VC++ Achieve SA algorithm, solving the 48 cities in the shortest path problem

任意生成一个M*N的矩阵，并根据深度优先算法和广度优先算法寻找一条或多条最短路径，通过图形化的界面标记输出各个节点的坐标。要求迷宫是随机并且是连通的。-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 ma