如何在广度优先搜索中跟踪路径？

from collections import deque

def bfs_with_path(graph, start, goal):
    queue = deque([start])
    visited = set([start])
    parent = {start: None}
    
    while queue:
        node = queue.popleft()
        if node == goal:
            break
        for neighbor in graph[node]:
            if neighbor not in visited:
                visited.add(neighbor)
                queue.append(neighbor)
                parent[neighbor] = node
    
    # 回溯路径
    path = []
    current = goal
    while current is not None:
        path.append(current)
        current = parent[current]
    path.reverse()
    return path

def bfs_with_path_dict(graph, start, goal):
    queue = deque([start])
    visited = set([start])
    path = {start: [start]}
    
    while queue:
        node = queue.popleft()
        if node == goal:
            break
        for neighbor in graph[node]:
            if neighbor not in visited:
                visited.add(neighbor)
                queue.append(neighbor)
                path[neighbor] = path[node] + [neighbor]
    
    return path[goal]