This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.


intersection(G, H)[source]

Return 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.


GH : 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)