#

Note

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

#

networkx.algorithms.euler.eulerize

eulerize(G)[source]

Transforms a graph into an Eulerian graph

Parameters

G (NetworkX graph) – An undirected graph

Returns

G

Return type

NetworkX multigraph

Raises

NetworkXError – If the graph is not connected.

See also

is_eulerian(), eulerian_circuit()

References

1

J. Edmonds, E. L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical programming, Volume 5, Issue 1 (1973), 111-114. [2] https://en.wikipedia.org/wiki/Eulerian_path

3

http://web.math.princeton.edu/math_alive/5/Notes1.pdf

Examples

>>> G = nx.complete_graph(10)
>>> H = nx.eulerize(G)
>>> nx.is_eulerian(H)
True