如何返回Y跳上至少有X条路径的所有节点

def find_nodes_with_x_paths(graph, start_node, target_node, current_node, current_path, current_jumps, target_jumps, result):
    if current_jumps == target_jumps:
        if current_node == target_node:
            result.append(current_node)
        return
    
    if current_jumps < target_jumps:
        current_path.append(current_node)
        for neighbor in graph[current_node]:
            find_nodes_with_x_paths(graph, start_node, target_node, neighbor, current_path, current_jumps + 1, target_jumps, result)
        current_path.pop()

# 示例图的邻接表表示
graph = {
    'A': ['B', 'C'],
    'B': ['C', 'D'],
    'C': ['D', 'E'],
    'D': ['E'],
    'E': ['F'],
    'F': []
}

start_node = 'A'
target_node = 'E'
target_jumps = 3

result = []
find_nodes_with_x_paths(graph, start_node, target_node, start_node, [], 0, target_jumps, result)
print(result)