Task: Sentence Expansion
Input (English): A eulerian path in a graph is one that visits each edge of the graph once only .
Output (English): In graph theory , an Eulerian trail ( or Eulerian path ) is a trail in a finite graph that visits every edge exactly once ( allowing for revisiting vertices ) .