Answer
The original statement is false.
Work Step by Step
A path that travels through every edge of a graph exactly once is called an Euler path. If an Euler path starts and ends at the same vertex, then it is an Euler circuit.
However, if an Euler path starts at one vertex and ends at a different vertex, then it is not an Euler circuit. So an Euler path is not necessarily an Euler circuit.
Therefore, not every Euler path is an Euler circuit.
