Based on standard defination, [Eulerian Path](http://en.wikipedia.org/wiki/Eulerian_path) is a path in graph that visits every edge exactly once.

Now, I am trying to find a Euler path in a directed Graph. I know the algorithm for Euler circuit. Its seems trivial that if a Graph has Euler circuit it has Euler path. ![source:geeksforgeeks](https://i.stack.imgur.com/3S3Hl.png)

[image source: geeksforgeeks.org]

So for above directed graph which has a Euler circuit also has Euler path. 

Now if i remove an Edge lets say from 4 to 0 it is no more an Euler circuit. 

1. if start my DFS from vertex 0 i still have Euler Path.
2. if start from vertex 3 i do not have Euler path

So, is it a requirement, that a directed graph has to be in Euler circuit to be an Euler path? I thought, Euler path should be less restrictive then Euler circuit.

Is there any directed graph which can be Euler path but not Euler circuit.