一元稀疏多项式计算器、迷宫问题、成绩分析问题、图的基本操作与实现以及背包问题的求解-One yuan sparse polynomial calculator, maze, performance analysis of the problem, graph realization of the basic operations and the knapsack problem and the solution

令W[x][y]= = 1，表示空间（x, y）为墙 W[x][y] = = 0，表示空间（x, y）为洞 当W[x][y] = = 0且W[x][y+1] = = 0，表示从点(x, y)到点(x, y+1)有从西向东的通路；当W[x][y] = = 0且W[x+1][y] = = 0表示从点(x, y)到点(x+1, y)到从北向南的通路。迷宫的入口(0, 0)，出口是右下角（在本例中是(7, 8)），希望你编写程序搜索一条由入口到出口的路径。迷宫规模： -The littl

软件学院实训阶段三任务3 - 挖迷宫，拼图并设计优化方案-Software Engineering Training Stage Three Task 3- digging maze, puzzle and design optimization