python实现图结构中如何得到三跳的结点

可以使用广度优先搜索（BFS）来找到图中所有距离为三的节点

from collections import deque
 
def find_nodes_with_distance_three(graph, start_node):
    visited = set()
    queue = deque([(start_node, 0)])
    visited.add(start_node)
    
    while queue:
        (node, distance) = queue.popleft()
        if distance == 3:
            yield node
        for neighbor in graph[node]:
            if neighbor not in visited:
                visited.add(neighbor)
                queue.append((neighbor, distance + 1))
 
# 示例图
graph = {
    'A': ['B', 'C'],
    'B': ['A', 'D', 'E'],
    'C': ['A', 'F'],
    'D': ['B', 'E', 'G'],
    'E': ['B', 'D'],
    'F': ['C'],
    'G': ['D']
}
 
# 使用函数
for node in find_nodes_with_distance_three(graph, 'A'):
    print(node)