DiGraph.adjacency

DiGraph.adjacency()

返回一个迭代器，遍历所有节点的 (节点, 邻接字典) 元组。

对于有向图，仅包含出边邻居/邻接关系。

Returns:

adj_iter迭代器

一个迭代器，遍历图中的所有节点及其邻接字典。

Examples

>>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
>>> [(n, nbrdict) for n, nbrdict in G.adjacency()]
[(0, {1: {}}), (1, {0: {}, 2: {}}), (2, {1: {}, 3: {}}), (3, {2: {}})]