برنامه مسیریابی در ماتریس دو بعدی

سلام این جواب اولین برنامه خواسته شده هست یعنی مسیر یابی من با پایتون نوشتم نمی دونم به دردتون می خوره یا نه !!

کد:

t=[[0,0,0,0,0,0,0,0,0,0], [1,1,1,1,1,0,0,0,0,0], [0,0,0,1,0,0,0,0,0,0], [0,0,0,1,1,0,0,0,0,0], [0,0,0,1,0,1,1,1,1,0], [0,1,1,1,0,1,0,1,0,0], [0,1,0,0,0,1,0,1,1,0], [0,1,0,0,0,1,0,0,1,0], [0,1,1,1,1,1,1,0,1,1], [0,0,0,0,0,0,0,0,0,0],] def pp(): print "\n========================" for row in t: for col in row: if col==0 : print "#", else: print "O", print print "========================\n" pp() def findroute(t,x,y): t[x][y]=0 try : if (x,y)==(8,9): print "\nOOOOOOOKKKKKKK" return 1 if t[x][y+1]==1: print "[%d,%d] => [%d,%d]"%(x,y,x,y+1) if findroute(t,x,y+1)==1 : return 1 if t[x+1][y]==1: print "[%d,%d] => [%d,%d]"%(x,y,x+1,y) if findroute(t,x+1,y)==1 : return 1 if t[x][y-1]==1: print "[%d,%d] => [%d,%d]"%(x,y,x,y-1) if findroute(t,x,y-1)==1: return 1 if t[x-1][y]==1: print "[%d,%d] => [%d,%d]"%(x,y,x-1,y) if findroute(t,x-1,y)==1: return 1 else: return 0 except: pass if findroute(t,1,0)==0 : print "is not a way !! ",

اینم خروجی :

کد:

======================== # # # # # # # # # # O O O O O # # # # # # # # O # # # # # # # # # O O # # # # # # # # O # O O O O # # O O O # O # O # # # O # # # O # O O # # O # # # O # # O # # O O O O O O # O O # # # # # # # # # # ======================== [1,0] => [1,1] [1,1] => [1,2] [1,2] => [1,3] [1,3] => [1,4] [1,3] => [2,3] [2,3] => [3,3] [3,3] => [3,4] [3,3] => [4,3] [4,3] => [5,3] [5,3] => [5,2] [5,2] => [5,1] [5,1] => [6,1] [6,1] => [7,1] [7,1] => [8,1] [8,1] => [8,2] [8,2] => [8,3] [8,3] => [8,4] [8,4] => [8,5] [8,5] => [8,6] [8,5] => [7,5] [7,5] => [6,5] [6,5] => [5,5] [5,5] => [4,5] [4,5] => [4,6] [4,6] => [4,7] [4,7] => [4,8] [4,7] => [5,7] [5,7] => [6,7] [6,7] => [6,8] [6,8] => [7,8] [7,8] => [8,8] [8,8] => [8,9] OOOOOOOKKKKKKK