Respetar la reimpresión: gráficas: matplotlib, DFS, prim
Github: https://github.com/Radium1209/Maze
Mira las representaciones dinámicas (lento):
laberinto de primera generación:
El principal uso de dos algoritmos: Prim y DFS
Resumen: Comparación de Prim genera como un laberinto real, por lo que el predeterminado utilizado Prim generado laberinto
referencia específica: https://blog.csdn.net/juzihongle1/article/details/73135920
Primera entrada n, m, generará un laberinto (generación Prim), entonces la forma dinámica a través de todo el laberinto.
Se utiliza el algoritmo BFS laberinto, en concreto, no hay mucho que decir, las mentiras de dificultad clave en la ruta de grabación:
Yo estaba usando una matriz de dos dimensiones para registrar la ruta de trayectoria, cada lugar se almacena en una ubicación en esta posición, hacia atrás en una pila de la última de nuevo punto al primer punto de la salida de la última normales pila es un camino.
camino de la pintura: hay arriba, abajo, izquierda, derecha, superior izquierda, superior derecha, inferior izquierda, inferior derecha e inferior izquierda, superior izquierda, superior derecha, abajo a la derecha en el caso de 12 Discusión (es demasiada molestia).
Finalmente generar exe con PyInstaller
Tutorial: https://blog.csdn.net/Radium_1209/article/details/82939368
todos los códigos
import random
import numpy as np
from matplotlib import pyplot as plt
import matplotlib.cm as cm
from collections import deque
import tkinter
//显示地图（图形化显示）
def show_maze(Maze):
plt.imshow(Maze, cmap=cm.Wistia_r, interpolation='none')
# plt.ion()
plt.show()
//用bfs查找路径
def find_path_bfs(image, M):
path = np.zeros((num_rows, num_cols, 2))
vis = np.zeros((num_rows, num_cols))
vis[0][0] = 1
Queue = deque()
Queue.append((0, 0))
while(Queue):
temp = Queue.popleft()
nr = temp[0]
nc = temp[1]
if (nc == num_cols - 1) and (nr == num_rows - 1):
show_path(image, path)
break
if (nc > 0) and (not vis[nr][nc - 1]) and (M[nr][nc][0]):
vis[nr][nc] = 1
Queue.append((nr, nc - 1))
path[nr][nc - 1][0] = nr
path[nr][nc - 1][1] = nc
if (nr > 0) and (not vis[nr - 1][nc]) and (M[nr][nc][1]):
vis[nr][nc] = 1
Queue.append((nr - 1, nc))
path[nr - 1][nc][0] = nr
path[nr - 1][nc][1] = nc
if (nc < num_cols - 1) and (not vis[nr][nc + 1]) and (M[nr][nc][2]):
vis[nr][nc] = 1
Queue.append((nr, nc + 1))
path[nr][nc + 1][0] = nr
path[nr][nc + 1][1] = nc
if (nr < num_rows - 1) and (not vis[nr + 1][nc]) and (M[nr][nc][3]):
vis[nr][nc] = 1
Queue.append((nr + 1, nc))
path[nr + 1][nc][0] = nr
path[nr + 1][nc][1] = nc
//prim算法生成地图
def Create_maze_prim():
M = np.zeros((num_rows, num_cols, 5))
image = np.zeros((num_rows * 10, num_cols * 10))
r = 0
c = 0
history = [(r, c)]
while history:
M[r, c, 4] = 1
check = []
if c > 0 and M[r, c - 1, 4] == 0:
check.append('L')
if r > 0 and M[r - 1, c, 4] == 0:
check.append('U')
if c < num_cols - 1 and M[r, c + 1, 4] == 0:
check.append('R')
if r < num_rows - 1 and M[r + 1, c, 4] == 0:
check.append('D')
if len(check):
history.append([r, c])
move_direction = random.choice(check)
if move_direction == 'L':
M[r, c, 0] = 1
c = c - 1
M[r, c, 2] = 1
if move_direction == 'U':
M[r, c, 1] = 1
r = r - 1
M[r, c, 3] = 1
if move_direction == 'R':
M[r, c, 2] = 1
c = c + 1
M[r, c, 0] = 1
if move_direction == 'D':
M[r, c, 3] = 1
r = r + 1
M[r, c, 1] = 1
else:
r, c = history.pop()
M[0, 0, 0] = 1
M[num_rows - 1, num_cols - 1, 2] = 1
for row in range(0, num_rows):
for col in range(0, num_cols):
cell_data = M[row, col]
for i in range(10 * row + 2, 10 * row + 8):
image[i, range(10 * col + 2, 10 * col + 8)] = 255
if cell_data[0] == 1:
image[range(10 * row + 2, 10 * row + 8), 10 * col] = 255
image[range(10 * row + 2, 10 * row + 8), 10 * col + 1] = 255
if cell_data[1] == 1:
image[10 * row, range(10 * col + 2, 10 * col + 8)] = 255
image[10 * row + 1, range(10 * col + 2, 10 * col + 8)] = 255
if cell_data[2] == 1:
image[range(10 * row + 2, 10 * row + 8), 10 * col + 9] = 255
image[range(10 * row + 2, 10 * row + 8), 10 * col + 8] = 255
if cell_data[3] == 1:
image[10 * row + 9, range(10 * col + 2, 10 * col + 8)] = 255
image[10 * row + 8, range(10 * col + 2, 10 * col + 8)] = 255
return M, image
//dfs方法生成地图
def Create_maze_dfs():
M = np.zeros((num_rows, num_cols, 5))
image = np.zeros((num_rows * 10, num_cols * 10))
r = 0
c = 0
history = [(r, c)]
while history:
r, c = random.choice(history)
M[r, c, 4] = 1
history.remove((r, c))
check = []
if c > 0:
if M[r, c - 1, 4] == 1:
check.append('L')
elif M[r, c - 1, 4] == 0:
history.append((r, c - 1))
M[r, c - 1, 4] = 2
if r > 0:
if M[r - 1, c, 4] == 1:
check.append('U')
elif M[r - 1, c, 4] == 0:
history.append((r - 1, c))
M[r - 1, c, 4] = 2
if c < num_cols - 1:
if M[r, c + 1, 4] == 1:
check.append('R')
elif M[r, c + 1, 4] == 0:
history.append((r, c + 1))
M[r, c + 1, 4] = 2
if r < num_rows - 1:
if M[r + 1, c, 4] == 1:
check.append('D')
elif M[r + 1, c, 4] == 0:
history.append((r + 1, c))
M[r + 1, c, 4] = 2
if len(check):
move_direction = random.choice(check)
if move_direction == 'L':
M[r, c, 0] = 1
c = c - 1
M[r, c, 2] = 1
if move_direction == 'U':
M[r, c, 1] = 1
r = r - 1
M[r, c, 3] = 1
if move_direction == 'R':
M[r, c, 2] = 1
c = c + 1
M[r, c, 0] = 1
if move_direction == 'D':
M[r, c, 3] = 1
r = r + 1
M[r, c, 1] = 1
M[0, 0, 0] = 1
M[num_rows - 1, num_cols - 1, 2] = 1
for row in range(0, num_rows):
for col in range(0, num_cols):
cell_data = M[row, col]
for i in range(10 * row + 2, 10 * row + 8):
image[i, range(10 * col + 2, 10 * col + 8)] = 255
if cell_data[0] == 1:
image[range(10 * row + 2, 10 * row + 8), 10 * col] = 255
image[range(10 * row + 2, 10 * row + 8), 10 * col + 1] = 255
if cell_data[1] == 1:
image[10 * row, range(10 * col + 2, 10 * col + 8)] = 255
image[10 * row + 1, range(10 * col + 2, 10 * col + 8)] = 255
if cell_data[2] == 1:
image[range(10 * row + 2, 10 * row + 8), 10 * col + 9] = 255
image[range(10 * row + 2, 10 * row + 8), 10 * col + 8] = 255
if cell_data[3] == 1:
image[10 * row + 9, range(10 * col + 2, 10 * col + 8)] = 255
image[10 * row + 8, range(10 * col + 2, 10 * col + 8)] = 255
return M, image
//显示路径（图形化）
def show_path(image, path):
plt.imshow(image, cmap=cm.Wistia_r, interpolation='none')
plt.ion()
plt.pause(2)
str = ""
stack = []
nr = num_rows - 1
nc = num_cols - 1
stack.append((nr, nc + 1))
stack.append((nr, nc))
while nr or nc:
tr = nr
tc = nc
nr = (int)(path[tr][tc][0])
nc = (int)(path[tr][tc][1])
stack.append((nr, nc))
# stack.append((num_rows, num_cols))
pr = 0
pc = 0
dir = 2
color_num = 150
while(stack):
temp = stack.pop()
nr = temp[0]
nc = temp[1]
if nr or nc:
if (nr == pr):
if (nc > pc):
# print("R")
if (dir == 2):
image[10 * pr + 4,
range(10 * pc + 0, 10 * pc + 10)] = color_num
image[10 * pr + 5,
range(10 * pc + 0, 10 * pc + 10)] = color_num
elif (dir == 1):
image[10 * pr + 4,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[10 * pr + 5,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 4] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 5] = color_num
elif (dir == 3):
image[10 * pr + 4,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[10 * pr + 5,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 4] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 5] = color_num
dir = 2
else:
# print("L")
if (dir == 0):
image[10 * pr + 4,
range(10 * pc + 0, 10 * pc + 10)] = color_num
image[10 * pr + 5,
range(10 * pc + 0, 10 * pc + 10)] = color_num
elif (dir == 1):
image[10 * pr + 4,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[10 * pr + 5,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 4] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 5] = color_num
elif (dir == 3):
image[10 * pr + 4,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[10 * pr + 5,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 4] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 5] = color_num
dir = 0
elif (nc == pc):
if (nr > pr):
# print("D")
if (dir == 3):
image[range(10 * pr + 0, 10 * pr + 10),
10 * pc + 4] = color_num
image[range(10 * pr + 0, 10 * pr + 10),
10 * pc + 5] = color_num
elif (dir == 0):
image[10 * pr + 4,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[10 * pr + 5,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 4] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 5] = color_num
elif (dir == 2):
image[10 * pr + 4,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[10 * pr + 5,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 4] = color_num
image[range(10 * pr + 4, 10 * pr + 10),
10 * pc + 5] = color_num
dir = 3
else:
# print("U")
if (dir == 1):
image[range(10 * pr + 0, 10 * pr + 10),
10 * pc + 4] = color_num
image[range(10 * pr + 0, 10 * pr + 10),
10 * pc + 5] = color_num
elif (dir == 0):
image[10 * pr + 4,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[10 * pr + 5,
range(10 * pc + 4, 10 * pc + 10)] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 4] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 5] = color_num
elif (dir == 2):
image[10 * pr + 4,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[10 * pr + 5,
range(10 * pc + 0, 10 * pc + 6)] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 4] = color_num
image[range(10 * pr + 0, 10 * pr + 6),
10 * pc + 5] = color_num
dir = 1
pr = nr
pc = nc
plt.clf()
plt.imshow(image, cmap=cm.Wistia_r, interpolation='none')
# plt.ion()
if (stack):
plt.ion()
plt.pause(0.03 / (num_cols * num_rows / 100))
else:
plt.ioff()
plt.show()
# plt.pause(1000)
//主函数
if __name__ == '__main__':
num_rows = int(input("Please input rows: "))
num_cols = int(input("Please input columns: "))
path = np.zeros((num_rows, num_cols, 2))
M = np.zeros((num_rows, num_cols, 5))
image = np.zeros((num_rows * 10, num_cols * 10))
# row_image = np.zeros((num_rows * 10, num_cols * 10))
M, image = Create_maze_prim()
# show_maze(image)
find_path_bfs(image, M)
# show_path(image, path)
