networkx.difference

difference(G, H, create_using=None)

Return a new graph that contains the edges that exist in in G but not in H.

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

Parameters:

G,H : graph

A NetworkX graph

create_using : NetworkX graph

Use specified graph for result. Otherwise a new graph is created.

Notes

If you want an new graph consisting of the difference of the node sets of G and H with the edges from G use

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