Transforms a graph into an Eulerian graph.
Gis Eulerian the result is
Gas a MultiGraph, otherwise the result is a smallest (in terms of the number of edges) multigraph whose underlying simple graph is
- GNetworkX graph
An undirected graph
- GNetworkX multigraph
If the graph is not connected.
J. Edmonds, E. L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical programming, Volume 5, Issue 1 (1973), 111-114.
>>> G = nx.complete_graph(10) >>> H = nx.eulerize(G) >>> nx.is_eulerian(H) True