eulerian_path(G, source=None, keys=False)

Parameters

G : NetworkX Graph

The graph in which to look for an eulerian path.

source : node or None (default: None)

The node at which to start the search. None means search over all starting nodes.

keys : Bool (default: False)

Indicates whether to yield edge 3-tuples (u, v, edge_key). The default yields edge 2-tuples

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

Yields

Edge tuples along the eulerian path.

Warning: If `source` provided is not the start node of an Euler path

will raise error even if an Euler Path exists.

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.euler.has_eulerian_path

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/euler.py#328
type: <class 'function'>
Commit: