This documents the development version of NetworkX. Documentation for the current release can be found here.


intersection(G, H)[source]

Returns a new graph that contains only the edges that exist in both G and H.

The node sets of H and G must be the same.


G,H (graph) – A NetworkX graph. G and H must have the same node sets.



Return type

A new graph with the same type as G.


Attributes from the graph, nodes, and edges are not copied to the new graph. If you want a new graph of the intersection of G and H with the attributes (including edge data) from G use remove_nodes_from() as follows

>>> G=nx.path_graph(3)
>>> H=nx.path_graph(5)
>>> R=G.copy()
>>> R.remove_nodes_from(n for n in G if n not in H)