For a directed connected graph:
Euler circuit exists if and only if every vertex has equal in-degree and out-degree.
Euler path exists if and only if:
- At most one vertex has (this is the start)
- At most one vertex has (this is the end)
- All other vertices have equal in-degree and out-degree
Check connectivity: The underlying undirected graph must be connected (ignoring edge directions).