迷宫的最短路径（按c++的python改写）

下面是代码，结果有点问题，明天再改改

# -*- coding: utf-8 -*-
"""
Created on Mon Aug 28 22:12:01 2017

@author: Administrator
"""
import numpy as np
import queue
INF=1000000
que = queue.Queue()#建队列变量

maze=np.array([[1,2,1,1,1,1,1,1,0,1],#0 代表通道，1代表墙，2代表入口，3代表出口
              [0,0,0,0,0,0,1,0,0,1],
              [0,1,0,1,1,0,1,1,0,1],
              [0,1,0,0,0,0,0,0,0,0],
              [1,1,0,1,1,0,1,1,1,1],
              [0,0,0,0,1,0,0,0,0,1],
              [0,1,1,1,1,1,1,1,0,1],
              [0,0,0,0,1,0,0,0,0,0],
              [0,1,1,1,1,0,1,1,1,0],
              [0,0,0,0,1,0,0,0,3,1]])
d=maze#其实只是复制一个与maze大小的数组，后面会先全部设置为INF
N,M=maze.s