Note

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

Eulerian

Eulerian circuits and graphs.

is_eulerian(G)

Returns True if and only if G is Eulerian.

eulerian_circuit(G[, source, keys])

Returns an iterator over the edges of an Eulerian circuit in G.

eulerize(G)

Transforms a graph into an Eulerian graph

is_semieulerian(G)

Return True iff G is semi-Eulerian.

has_eulerian_path(G)

Return True iff G has an Eulerian path.

eulerian_path(G[, source, keys])

Return an iterator over the edges of an Eulerian path in G.