identified_nodes(G, u, v, self_loops=True)¶
Returns the graph that results from contracting
Node contraction identifies the two nodes as a single node incident to any edge that was incident to the original two nodes.
- G (NetworkX graph) – The graph whose nodes will be contracted.
- v (u,) – Must be nodes in
- self_loops (Boolean) – If this is
True, any edges joining
Gbecome self-loops on the new node in the returned graph.
A new graph object of the same type as
videntified in a single node. The right node
vwill be merged into the node
u, so only
uwill appear in the returned graph.
Contracting two nonadjacent nodes of the cycle graph on four nodes \(C_4\) yields the path graph (ignoring parallel edges):
>>> import networkx as nx >>> G = nx.cycle_graph(4) >>> M = nx.contracted_nodes(G, 1, 3) >>> P3 = nx.path_graph(3) >>> nx.is_isomorphic(M, P3) True
This function is also available as