用python 写一段A*算法的代码

当然可以，给您展示一下A*算法的代码：

def astar(start, end, graph):
    open_list = [start]
    closed_list = []

    while open_list:
        current = open_list[0]
        for node in open_list:
            if node.f < current.f:
                current = node

        open_list.remove(current)
        closed_list.append(current)

        if current == end:
            path = []
            while current.parent:
                path.append(current)
                current = current.parent
            return path[::-1]

        for neighbor in graph[current]:
            if neighbor in closed_list:
                continue

            g = current.g + graph[current][neighbor]
            if neighbor in open_list:
                if g < neighbor.g:
                    neighbor.g = g
                    neighbor.parent = current
            else:
                neighbor.g = g
                neighbor.h = heuristic(neighbor, end)
                neighbor.f = neighbor.g + neighbor.h
                neighbor.parent = current
                open_list.append(neighbor)

    return None

以上代码实现了用A*算法来寻找从起点到终点的最优路径，其中用到了启发式函数(heuristic)，它可以帮助我们估计一个点到终点的距离，从而更加高效地搜索最短路径。希望能对您有所帮助！