想要使用Python实现一个动态的最佳路径规划效果图，类似于A*算法的输出，请编写一下程序

要在Python中实现一个动态最佳路径规划效果，比如基于A*算法的图搜索，你可以使用`pygame`库来显示地图和动画，以及`heapq`处理优先队列。以下是一个简单的示例，假设你已经有了一个表示地图的二维网格列表：

import pygame
import heapq

# 假设地图数据，0表示障碍，1表示可以通行，2表示起点，3表示终点
grid = [
    [0, 0, 1, 0],
    [0, 0, 0, 0],
    [0, 1, 0, 3],
    [0, 0, 2, 0]
]

# 定义节点类，包含坐标、g值、f值等信息
class Node:
    def __init__(self, x, y, g=0, f=0):
        self.x = x
        self.y = y
        self.g = g
        self.f = f
        self.prev = None

    # 计算f值（启发式函数）
    def heuristic(self, goal_node):
        return abs(self.x - goal_node.x) + abs(self.y - goal_node.y)

def a_star_search(grid, start, end):
    frontier = [(start.f, start)]
    visited = set()

    while frontier:
        _, current = heapq.heappop(frontier)
        if current == end:
            path = []
            while current is not None:
                path.append((current.x, current.y))
                current = current.prev
            return path[::-1]  # 返回路径逆序

        visited.add(current)
        for dx, dy in [(0, -1), (0, 1), (-1, 0), (1, 0)]:
            nx, ny = current.x + dx, current.y + dy
            if 0 <= nx < len(grid) and 0 <= ny < len(grid[0]) and grid[nx][ny] != 0:
                neighbor = Node(nx, ny, g=current.g + 1, f=current.g + current.heuristic(end))
                if neighbor not in visited:
                    neighbor.prev = current
                    heapq.heappush(frontier, (neighbor.f, neighbor))

# 初始化Pygame
pygame.init()
screen = pygame.display.set_mode((800, 600))
clock = pygame.time.Clock()

# 渲染地图和路径
def draw_map(map_data, path=None):
    for i in range(len(map_data)):
        for j in range(len(map_data[i])):
            if map_data[i][j] == 0:
                color = (255, 255, 255)  # 障碍物白色
            elif map_data[i][j] == 1 or map_data[i][j] == 2:
                color = (0, 0, 0)       # 可通行区域黑色
            elif map_data[i][j] == 3:
                color = (255, 0, 0)     # 终点红色
            if path and (i, j) in path:
                pygame.draw.rect(screen, (0, 255, 0), (i * 50, j * 50, 50, 50))  # 路径绿色方块

# 主循环
while True:
    for event in pygame.event.get():
        if event.type == pygame.QUIT:
            pygame.quit()
            quit()

    screen.fill((255, 255, 255))  # 清除屏幕背景
    draw_map(grid, a_star_search(grid, (0, 0), (len(grid)-1, len(grid[0])-1)))
    pygame.display.update()
    clock.tick(10)  # 控制帧率