Graph
Euler Path
A path that traverses all the edges exactly once.
Euler Circuit
An Euler path that starts and ends at the same node.
| Circuit | Path | |
|---|---|---|
| Undirected | Every vertex has an even degree | Either every vertex has even degree or exactly two vertices has odd degree |
| Directed | Every vertex has an even indegree and outdegree | At most one vertex has outdegree-indegree = 1 and atmost one vertex has indegree-outdegree=1 and all other vertices have equal in and out degrees |
| Start Node | Any. | Any if circuit otherwise, the node with out-in = 1. The node with in-out=1 is the end node in path |