An Eulerian Path is a trail in a graph that visits every edge exactly once, and it exists if and only if the graph is connected and has exactly zero or two vertices of odd degree. If a graph has exactly two vertices of odd degree, any Eulerian Path will start at one of these vertices and end at the other.