common_neighbors(G, u, v)¶
Return the common neighbors of two nodes in a graph.
- G (graph) – A NetworkX undirected graph.
- u, v (nodes) – Nodes in the graph.
cnbors – Iterator of common neighbors of u and v in the graph.
NetworkXError– If u or v is not a node in the graph.
>>> G = nx.complete_graph(5) >>> sorted(nx.common_neighbors(G, 0, 1)) [2, 3, 4]