networkx.Graph.to_undirected¶

Graph.
to_undirected
(as_view=False)[source]¶ Returns an undirected copy of the graph.
 Parameters
as_view (bool (optional, default=False)) – If True return a view of the original undirected graph.
 Returns
G – A deepcopy of the graph.
 Return type
Graph/MultiGraph
See also
Notes
This returns a “deepcopy” of the edge, node, and graph attributes which attempts to completely copy all of the data and references.
This is in contrast to the similar
G = nx.DiGraph(D)
which returns a shallow copy of the data.See the Python copy module for more information on shallow and deep copies, https://docs.python.org/2/library/copy.html.
Warning: If you have subclassed DiGraph to use dictlike objects in the data structure, those changes do not transfer to the Graph created by this method.
Examples
>>> G = nx.path_graph(2) # or MultiGraph, etc >>> H = G.to_directed() >>> list(H.edges) [(0, 1), (1, 0)] >>> G2 = H.to_undirected() >>> list(G2.edges) [(0, 1)]