# -*- coding:utf-8 -*-def init():  global graph  graph.append([-1,  -1, -1, -1, -1, -1,  -1])  graph.append([-1,  0, 0, -1, 0, 0,  -1])  graph.append([-1,  0, -1, 0, 0, 0,  -1])  graph.append([-1,  0, -1, 0, -1, -1,  -1])  graph.append([-1,  0, -1, 0, 0, 0,  -1])  graph.append([-1,  0, 0, 0, -1, 0,  -1])  graph.append([-1,  0, 0, 0, 0, 0,  -1])  graph.append([-1,  -1, -1, -1, -1, -1,  -1])#深度優先遍歷def deepFirstSearch( steps , x, y ):  global graph  current_step = steps + 1  print(x, y, current_step )  graph[x][y] = current_step  next_step = current_step + 1  '''  遍歷周圍4個點:    如果周圍節點不是-1 說明 不是障礙 在此基礎上：        里面是0 說明沒遍歷過 我們把它修改成當前所在位置步數加1        里面比當前的next_step大 說明不是最優方案 就修改它        里面比當前next_step說明當前不是最優方案，不修改  '''  if not(x-1== 1 and y==1) and graph[x-1][y] != -1 and ( graph[x-1][y]>next_step or graph[x-1][y] ==0 ) : #左    deepFirstSearch(current_step, x-1 , y )  if not(x == 1 and y-1==1) and graph[x][y-1] != -1 and ( graph[x][y-1]>next_step or graph[x][y-1] ==0 ) : #上    deepFirstSearch(current_step, x , y-1 )  if not(x == 1 and y+1==1) and graph[x][y+1] != -1 and ( graph[x][y+1]>next_step or graph[x][y+1]==0 ) : #下    deepFirstSearch(current_step, x , y+1 )  if not(x+1== 1 and y==1) and graph[x+1][y] != -1 and ( graph[x+1][y]>next_step or graph[x+1][y]==0 ) : #右    deepFirstSearch(current_step, x+1 , y )if __name__ == "__main__":  graph = []  init()  deepFirstSearch(-1,1,1)  print(graph[1][5])