如何打印Dijikstra计算后的路径？

def print_path(prev, target):
    path = []
    node = target
    while node != -1:
        path.append(node)
        node = prev[node]
    path.reverse()
    print("最短路径为：", path)

# 示例图的邻接矩阵表示
graph = [
    [0, 7, 9, -1, -1, 14],
    [7, 0, 10, 15, -1, -1],
    [9, 10, 0, 11, -1, 2],
    [-1, 15, 11, 0, 6, -1],
    [-1, -1, -1, 6, 0, 9],
    [14, -1, 2, -1, 9, 0]
]

start = 0  # 起始节点
target = 4  # 目标节点

# 初始化距离数组和前驱数组
dist = [float('inf')] * len(graph)
prev = [-1] * len(graph)

dist[start] = 0

# Dijkstra算法计算最短路径
for _ in range(len(graph)):
    u = -1
    min_dist = float('inf')
    for i in range(len(graph)):
        if dist[i] < min_dist and prev[i] == -1:
            u = i
            min_dist = dist[i]
    if u == -1:
        break
    prev[u] = 0
    for v in range(len(graph)):
        if graph[u][v] != -1 and dist[u] + graph[u][v] < dist[v]:
            dist[v] = dist[u] + graph[u][v]
            prev[v] = u

# 打印最短路径
print_path(prev, target)