寻找节点的n阶邻居

Question

我是networkx的新手，实际上对如何有效地找到节点的n次邻域有点困惑。节点vui的n次邻域是距离vui正好n个跳的节点集，给定一个指定的n，我需要找到图/网络中每个节点的n次邻域。在

假设我有下面的图，我想找到节点v1的n=1邻域。那就是v2和v3。接下来假设我想找到节点v1的n=2邻域，那么它就是v4。在

Answer 1

import networkx as nx
G = nx.Graph()
G.add_edges_from([('v1','v2'),('v2','v4'),('v1','v3')])

def neighborhood(G, node, n):
    path_lengths = nx.single_source_dijkstra_path_length(G, node)
    return [node for node, length in path_lengths.iteritems()
                    if length == n]

print(neighborhood(G, 'v1', 1))
# ['v2', 'v3']
print(neighborhood(G, 'v1', 2))
# ['v4']