euclidean, complete) printed_maze = Printer([row[:] for row in maze_and_start[0]]) e_print = Printer([row[:] for row in maze_and_start[0]]) m_print = Printer([row[:] for row in maze_and_start[0]]) e.find_paths() m.find_paths() printed_maze.print() print() print('--------------------------------------------------') print() print("Manhattan") print() e_print.overlay_path(e.path.get(maze_and_start[2])).print() print() e_swag = e.swag_list_for(maze_and_start[2]) e_sorted_swag = SwagFormatter().format( QuickSort(e_swag, 0, len(e_swag) - 1).sort()) print('You collected the following items: {0}'.format(e_sorted_swag)) print("It took {0} cycles to find the shortest path".format(e.count)) print("The length of the path is {0} cells.".format( len(e.path.get(maze_and_start[2])))) print() print('Euclidean') print() m_print.overlay_path(m.path.get(maze_and_start[2])).print() print() m_swag = m.swag_list_for(maze_and_start[2])
euclidean, complete) printed_maze = Printer([row[:] for row in maze_and_start[0]]) d_print = Printer([row[:] for row in maze_and_start[0]]) a_print = Printer([row[:] for row in maze_and_start[0]]) d.find_paths() a.find_paths() printed_maze.print() print() print('--------------------------------------------------') print() print("Dijkstra's") print() d_print.overlay_path(d.path.get(maze_and_start[2])).print() print() d_swag = d.swag_list_for(maze_and_start[2]) d_sorted_swag = SwagFormatter().format( QuickSort(d_swag, 0, len(d_swag) - 1).sort()) #d_sorted_swag = SwagFormatter().format(MergeSort().sort(d_swag)) print('You collected the following items: {0}'.format(d_sorted_swag)) print("It took {0} cycles to find the shortest path".format(d.count)) print("The length of the path is {0} cells.".format( len(d.path.get(maze_and_start[2])))) print() print('AStar') print() a_print.overlay_path(a.path.get(maze_and_start[2])).print() print()