Enter the edges of the graph G below, one per row, in the format "p q" (without the quotes), where p and q are two vertices. In an undirected graph, the sequence p q forms an edge (both p➔q and q➔p), whereas in a directed graph the sequence p q means the edge p➔q:

Enter a sequence of vertices P (this field is not required), separated by spaces to be checked if it's an Eulerian path. In an undirected graph, the sequence p q forms an edge (both p➔q and q➔p), whereas in a directed graph the sequence p q means the edge p➔q: